Given a string s and an array of strings words, determine how many strings in words are stretchy.

A query string can be stretched to match s by extending groups of consecutive identical characters. A character group in the query word can be extended if the corresponding group in s has a length of at least $3$ and is not shorter than the group in the query word. If the group in s has a length less than $3$, the group in the query word must match its length exactly without extension.

Return the total number of words in words that can be stretched to form s.

Constraints:

• $1 \leq$ s.length, words.length $\leq 100$

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

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

Input: s = aaabccccdd-str, words = [abccdd, aabccccdd, aaabcccdd, aaabccccddd]-List[str]
Output: 3-int
Explanation: Three words can be stretched to match s; one word cannot.

Input: s = abcd-str, words = [abcd, abc, abccd, abbcd]-List[str]
Output: 1-int
Explanation: Only abcd matches exactly; the other words cannot be stretched to form s.

Input: s = mmnnnpp-str, words = [mnnpp, mmnpp, mmnnppp, mmnnnpp]-List[str]
Output: 2-int
Explanation: Two words can be stretched to match s.

Input: s = a-str, words = [a, aa, b]-List[str]
Output: 1-int
Explanation: Only a can form s; aa and b cannot.

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.