<p>Given a string <code>s</code> and an integer <code>k</code>, return <em>the length of the longest substring of</em> <code>s</code> <em>such that the frequency of each character in this substring is greater than or equal to</em> <code>k</code>.</p>

<p data-pm-slice="1 1 []">if no such substring exists, return 0.</p>

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

<pre>
<strong>Input:</strong> s = &quot;aaabb&quot;, k = 3
<strong>Output:</strong> 3
<strong>Explanation:</strong> The longest substring is &quot;aaa&quot;, as &#39;a&#39; is repeated 3 times.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;ababbc&quot;, k = 2
<strong>Output:</strong> 5
<strong>Explanation:</strong> The longest substring is &quot;ababb&quot;, as &#39;a&#39; is repeated 2 times and &#39;b&#39; is repeated 3 times.
</pre>

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>4</sup></code></li>
	<li><code>s</code> consists of only lowercase English letters.</li>
	<li><code>1 &lt;= k &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    bool condition(unordered_map<char, int> mp, int k){
        for(auto i=mp.begin(); i!=mp.end(); i++){
            if(i->second<k) return false;
        }
        return true;
    }
    bool kReached(unordered_map<char, int> mp, int k){
        for(auto i=mp.begin(); i!=mp.end(); i++){
            if(i->second>=k) return true;
        }
        return false;
    }
    int longestSubstring(string s, int k) {
        //sliding windows variable size
        //calculation small, exact, more
        //condition freq of each >=3
        int i=0, j=0;
        int l=0;
        unordered_map<char, int> mp;
        int x=INT_MIN;
        while(j<s.size()){
            mp[s[j]]++;
            // cout<<mp[s[j]]<<" ";
            // if(!condition(mp, k)) j++;
            if(condition(mp, k)){
                l=max(l, j-i+1);
            }
            else if(kReached(mp, k)){
                int m=i;
                unordered_map<char, int> temp(mp);
                while(!condition(temp, k)){
                    cout<<temp[s[m]]<<" ";
                    temp[s[m]]--;
                    if(temp[s[m]]==0) temp.erase(s[m]);
                    m++;
                }
                cout<<" x = "<<x<<" . ";
                x=j-m+1;
                l=max(l, x);
            }
            j++;
        }
        if(l<k || k>s.size()) return 0;
        return l;
    }
};
54669