<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:
    int maxRepOpt1(string text) {
        vector<vector<int>> Hash(26, {-1, -1, -1});
        vector<vector<int>> Hash2(26, {-1, -1, -1});
		int n = text.length();
		int last = n;
		int ret = 0;
		for(int i=n-1; i>=0; i--){
			if(i == 0 || text[i] != text[i-1]){
				int currLen = last - i;
				int prevSt = Hash[text[i]- 'a'][0];
				int prevEn = Hash[text[i] - 'a'][1];
				int first = Hash[text[i] - 'a'][2];
				
				if(prevSt == last + 1){//one swap can work for me
					if(first != prevEn)
						currLen += (prevEn - prevSt + 2);
					else
						currLen += (prevEn - prevSt + 1);
				}else if(first != -1){
					currLen++;
				}
				
				ret = max(ret, currLen);
				Hash[text[i] - 'a'][0] = i;
				Hash[text[i] - 'a'][1] = last-1;
				if(first == -1){
					Hash[text[i] - 'a'][2] = last-1;
				}
				last = i;
			}
		}
		
        //cout << ret;
		last = -1;
		for(int i=0; i<n; i++){
			if(i == n-1 || text[i] != text[i+1]){
				int currLen = i - last;
				int prevSt = Hash2[text[i]- 'a'][0];
				int prevEn = Hash2[text[i] - 'a'][1];
				int first = Hash2[text[i] - 'a'][2];
				//cout << prevEn << " " << last << endl;
				if(prevEn != -1 && prevEn == last - 1){//one swap can work for me
					if(first != prevSt)
						currLen += (prevEn - prevSt + 2);
					else
						currLen += (prevEn - prevSt + 1);
                    //cout << currLen;
				}else if(first != -1){
					currLen++;
				}
				
				ret = max(ret, currLen);
				Hash2[text[i] - 'a'][0] = last + 1;
				Hash2[text[i] - 'a'][1] = i;
				if(first == -1){
					Hash2[text[i] - 'a'][2] = last+1;
				}
				last = i;
			}
		}
		
		return ret;
    }
};
8500