<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:
        from collections import defaultdict
        
        # Count the frequency of each character in the entire string
        char_count = defaultdict(int)
        for char in text:
            char_count[char] += 1
        
        max_len = 0
        n = len(text)
        i = 0
        
        while i < n:
            # Start of a new block of the same character
            char = text[i]
            j = i
            while j < n and text[j] == char:
                j += 1
            
            # Length of the current block
            current_block_length = j - i
            
            # Check if we can extend this block by swapping
            k = j + 1
            while k < n and text[k] == char:
                k += 1
            
            # Length of the next block of the same character
            next_block_length = k - j - 1
            
            # Calculate the maximum length we can achieve by swapping
            max_len = max(max_len, min(current_block_length + next_block_length + 1, char_count[char]))
            
            # Move to the next block
            i = j
        
        return max_len
16500