<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:
    def maxRepOpt1(self, text: str) -> int:
        c=Counter(text)
        res=0
        n=len(text)
        groups=[]
        prev=text[0]
        cnt=0
        for i in range(n):
            if(text[i]==prev):
                cnt+=1
            else:
                groups.append([prev,cnt])
                prev=text[i]
                cnt=1
        groups.append([prev,cnt])
        res=max(groups[0][1],groups[-1][1])
        for i in range(1,len(groups)-1):
            if(groups[i][1]==1):
                if(groups[i-1][0]==groups[i+1][0]):
                    if(c[groups[i-1][0]]>groups[i-1][1]+groups[i+1][1]):
                        res=max(res,groups[i-1][1]+groups[i+1][1]+1)
                    else:
                        res=max(res,groups[i-1][1]+groups[i+1][1])
            if(c[groups[i-1][0]]>groups[i-1][1]):
                res=max(res,groups[i-1][1]+1)
            else:
                res=max(res,groups[i-1][1])
            if(c[groups[i+1][0]]>groups[i+1][1]):
                res=max(res,groups[i+1][1]+1)
            else:
                res=max(res,groups[i+1][1])
            res=max(res,groups[i][1])
        return res
18400