<p>Given two strings <code>s1</code> and <code>s2</code>, return <code>true</code><em> if </em><code>s2</code><em> contains a permutation of </em><code>s1</code><em>, or </em><code>false</code><em> otherwise</em>.</p>

<p>In other words, return <code>true</code> if one of <code>s1</code>&#39;s permutations is the substring of <code>s2</code>.</p>

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

<pre>
<strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;eidbaooo&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> s2 contains one permutation of s1 (&quot;ba&quot;).
</pre>

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

<pre>
<strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;eidboaoo&quot;
<strong>Output:</strong> false
</pre>

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

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 10<sup>4</sup></code></li>
	<li><code>s1</code> and <code>s2</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool checkInclusion(string s1, string s2) {

        vector<int> arr(26,0);

        for(int i=0;i<s1.size();i++){
            int index= s1[i] - 'a';
            arr[index]++;
        }
         
        int i=0;
        int j=s1.size()-1;
        // cout<<j;

    
        
          
        while(j<s2.size()){
                
        vector<int> res(26,0);
            
            for(int x=i;x<=j;x++){
             int index= s2[x] - 'a';
                    res[index]++;
             
                
            }
            for(int i=0;i<26;i++){
                cout<<res[i]<<" ";
            }
            cout<<endl;
            bool flag=true;
            
            for(int i=0;i<26;i++){

                if(res[i]!=arr[i]){
                    flag=false;
                    
                }
            }
            
            if(flag){
                
                return true;
            }

          i++;
          j++;

        }

        return false;


        
    }
};
20721