Given a string s and an array of strings words, return the number of strings in words that are subsequences of s.

A string is a subsequence of s if it can be formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

Constraints:

• $1 \leq$ s.length $\leq 5 * 10^4$

• $1 \leq$ words.length $\leq 5000$

• $1 \leq$ words[i].length $\leq 50$

• s and words[i] consist of only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.