<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 helper(vector<int>& map, vector<int>& freq, int len) {
        int cntNotNull = 0;
        int maxiInd = 0;
        int cntMulOcc = 0;

        int ans = false;

        for(int i = 0; i < map.size(); i++) {
            if(map[i] != 0) cntNotNull++;
            if(map[i] > 1) cntMulOcc++;

            if(map[maxiInd] < map[i]) maxiInd = i;
            else if(map[maxiInd] == map[i] && freq[i] > freq[maxiInd]) maxiInd = i; 

        }


        if(cntNotNull > 2) return false;

        if(cntMulOcc > 1) return false;


        return freq[maxiInd] >= len;

    }
    int maxRepOpt1(string text) {
        vector<int> freq(26, 0);
        vector<int> map(26, 0);

        for(auto ele : text) freq[ele - 'a']++;

        int i = 0;
        int j = 0;

        int ans = 0;

        while(j < text.size()) {
            map[text[j] - 'a']++;

            while(!helper(map, freq, j - i + 1)) {
                map[text[i] - 'a']--;
                i++;
            }

            ans = max(ans, j - i + 1);
            j++;
        }

        return ans;

    }
};
8100