<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:
        charcount = Counter(text)        
        char_grp_seq = []
        char_grp_len = []
        for key, group in groupby(text):
            char_grp_seq.append(key)
            char_grp_len.append(sum(1 for _ in group))
        
        max_len = max(l_ + int(l_ < charcount[ch]) for ch, l_ in zip(char_grp_seq, char_grp_len))
        
        for i in range(1, len(char_grp_seq) - 1):
            if char_grp_seq[i - 1] == char_grp_seq[i + 1] and char_grp_len[i] == 1:
                total_len = char_grp_len[i - 1] + char_grp_len[i + 1]
                max_len = max(max_len, total_len + int(total_len < charcount[char_grp_seq[i - 1]]))
        return max_len
    
tests = (
    ("ababa", 3),
    ("aaabaaa", 6),
    ("aaaaa", 5),
)

for text, expected in tests:
    rv = Solution().maxRepOpt1(text)
    assert rv == expected, f'{rv}, {text}'
            
17200