<p>You are given a string <code>text</code>. You can swap two of the characters in the <code>text</code>.</p>

<p>Return <em>the length of the longest substring with repeated characters</em>.</p>

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

<pre>
<strong>Input:</strong> text = &quot;ababa&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong> We can swap the first &#39;b&#39; with the last &#39;a&#39;, or the last &#39;b&#39; with the first &#39;a&#39;. Then, the longest repeated character substring is &quot;aaa&quot; with length 3.
</pre>

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

<pre>
<strong>Input:</strong> text = &quot;aaabaaa&quot;
<strong>Output:</strong> 6
<strong>Explanation:</strong> Swap &#39;b&#39; with the last &#39;a&#39; (or the first &#39;a&#39;), and we get longest repeated character substring &quot;aaaaaa&quot; with length 6.
</pre>

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

<pre>
<strong>Input:</strong> text = &quot;aaaaa&quot;
<strong>Output:</strong> 5
<strong>Explanation:</strong> No need to swap, longest repeated character substring is &quot;aaaaa&quot; with length is 5.
</pre>

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

<ul>
	<li><code>1 &lt;= text.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>text</code> consist of lowercase English characters only.</li>
</ul>

class Solution {
public:

    bool check(vector<int>&cnt, int i, int j, vector<set<int>>&st){
        int length = j-i+1;
        int maxi = 0;
        int maxi1 = 0;
        char c1 = '!', c2 = '!';
        for(int k=0;k<26;k++){
            if(maxi < cnt[k]){
                maxi = cnt[k];
                c1 = 'a' + k;
            }
            else if(maxi == cnt[k]){
                maxi1 = maxi;
                c2 = 'a' + k;
            }
        }
        if(length - maxi >= 2) return true;
        if(length == maxi) return false;
        if(maxi == maxi1){
            if(st[c1-'a'].size() > st[c2-'a'].size()){

            }
            else{
                c1 = c2;
            }
        }
        if(maxi != st[c1-'a'].size()) return false;
        return true;
    }

    int maxRepOpt1(string text) {
        vector<set<int>> st(26);
        for(int i=0;i<text.size();i++){
            st[text[i]-'a'].insert(i);
        }
        int ans = 0;
        int i = 0, j = 0;
        char c = '!';
        vector<int> cnt(26, 0);
        while(j < text.size()){
            cnt[text[j]-'a']++;
            while(i <= j && check(cnt, i, j, st)){
                cnt[text[i]-'a']--;
                i++;
            }
            if(ans <= j-i+1)
            {
                ans = j-i+1;
            }
            j++;
        }
        cout<<c<<endl;
        cout<<ans<<endl;
        // int abc = 0;
        // for(int k=0;k<text.size();k++){
        //     if(text[k] == c) abc++;
        // }
        // if(ans > abc){
        //     ans = abc;
        // }
        return ans;
    }
};
13100