<p>Sometimes people repeat letters to represent extra feeling. For example:</p>

<ul>
	<li><code>&quot;hello&quot; -&gt; &quot;heeellooo&quot;</code></li>
	<li><code>&quot;hi&quot; -&gt; &quot;hiiii&quot;</code></li>
</ul>

<p>In these strings like <code>&quot;heeellooo&quot;</code>, we have groups of adjacent letters that are all the same: <code>&quot;h&quot;</code>, <code>&quot;eee&quot;</code>, <code>&quot;ll&quot;</code>, <code>&quot;ooo&quot;</code>.</p>

<p>You are given a string <code>s</code> and an array of query strings <code>words</code>. A query word is <strong>stretchy</strong> if it can be made to be equal to <code>s</code> by any number of applications of the following extension operation: choose a group consisting of characters <code>c</code>, and add some number of characters <code>c</code> to the group so that the size of the group is <strong>three or more</strong>.</p>

<ul>
	<li>For example, starting with <code>&quot;hello&quot;</code>, we could do an extension on the group <code>&quot;o&quot;</code> to get <code>&quot;hellooo&quot;</code>, but we cannot get <code>&quot;helloo&quot;</code> since the group <code>&quot;oo&quot;</code> has a size less than three. Also, we could do another extension like <code>&quot;ll&quot; -&gt; &quot;lllll&quot;</code> to get <code>&quot;helllllooo&quot;</code>. If <code>s = &quot;helllllooo&quot;</code>, then the query word <code>&quot;hello&quot;</code> would be <strong>stretchy</strong> because of these two extension operations: <code>query = &quot;hello&quot; -&gt; &quot;hellooo&quot; -&gt; &quot;helllllooo&quot; = s</code>.</li>
</ul>

<p>Return <em>the number of query strings that are <strong>stretchy</strong></em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;heeellooo&quot;, words = [&quot;hello&quot;, &quot;hi&quot;, &quot;helo&quot;]
<strong>Output:</strong> 1
<strong>Explanation:</strong> 
We can extend &quot;e&quot; and &quot;o&quot; in the word &quot;hello&quot; to get &quot;heeellooo&quot;.
We can&#39;t extend &quot;helo&quot; to get &quot;heeellooo&quot; because the group &quot;ll&quot; is not size 3 or more.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;zzzzzyyyyy&quot;, words = [&quot;zzyy&quot;,&quot;zy&quot;,&quot;zyy&quot;]
<strong>Output:</strong> 3
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length, words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>s</code> and <code>words[i]</code> consist of lowercase letters.</li>
</ul>

class Solution {
private:
int check(string &w,string &s){
    int i=0;
    int j=0;
    int c=0;
    if(w.size()>s.size()){
        return 0;
    }
    map<char,int>mpp1;
    map<char,int>mpp2;
    for(int i=0;i<w.size();i++){
        mpp1[w[i]]++;
    }
    for(int i=0;i<s.size();i++){
        mpp2[s[i]]++;
    }
    for(int i=0;i<w.size();i++){
        if(mpp2[w[i]]==0){
            return 0;
        }
    }
    for(int i=0;i<s.size();i++){
        if(mpp1[s[i]]==0){
            return 0;
        }
    }
    while(i<w.size()&&j<s.size()){
    char c1=w[i];
    char c2=s[j];
    int countw=0;
    int counts=0;
while(i<w.size()&&c1==w[i]){
    countw++;
    mpp1[w[i]]--;
    i++;
}
while(j<s.size()&&c2==s[j]){
    counts++;
    mpp2[s[j]]--;
    j++;
}
cout<<countw<<" "<<counts<<endl;
if(countw>counts){
    return 0;
}
if(countw<counts&&counts<3){
    c=1;
}
    }
while(j<s.size()){
    if(mpp2[s[j]]<=2){
        return 0;
    }
}

if(c==1){
    return 0;
}


return 1;
}    
public:
    int expressiveWords(string s, vector<string>& words) {
        int c=0;
        for(int i=0;i<words.size();i++){
            if(check(words[i],s)){
                c++;
            }
        }
        return c;
    }
};
16600