<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:
        char_count = Counter(text)

        blocks = []
        n = len(text)
        i = 0

        while i < n:
            ch = text[i]
            start = i
            while i < n and text[i] == ch:
                i += 1
            blocks.append((ch, i - start))

        max_len = 0

        for i, (ch, length) in enumerate(blocks):
            max_len = max(max_len, length)

            if 0 < i < len(blocks) - 1:
                prev_ch, prev_len = blocks[i - 1]
                next_ch, next_len = blocks[i + 1]

                if prev_ch == next_ch and length == 1:
                    max_len = max(max_len, prev_len + next_len + (1 if char_count[prev_ch] > prev_len + next_len else 0))

            if char_count[ch] > length:
                max_len = max(max_len, length + 1)

        return max_len

18000