<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) {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        
        unordered_map<char,int> m_ap;
        for(auto it :s1){
            m_ap[it]++;
        }
        int n=s2.size();
        for(int i=0;i<s2.size();i++){
            if(m_ap.find(s2[i])!=m_ap.end()){
                // cout<<"hii";
                unordered_map<char,int> temp;
                for(int j=i;j<i+s1.size()&&j<n;j++){
                    temp[s2[j]]++;
                }
                bool check=false;
              
                for(auto it:m_ap){
                    // cout<<it.first<<it.second<<endl;
                    if(temp.find(it.first)==temp.end()){
                        check=true;
                        break;
                    }else{
                        if(temp[it.first]!=it.second){
                        check=true;

                            break;
                        }
                    }
                }
                if(!check){
                    return true;
                }
            }
        }
        return false;
    }
};
90284