<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:
        max_length = 0
        character_counts = [0] * 26
        segments_list = []
        for char in text:
            character_counts[ord(char) - ord('a')] += 1
        segments_list.append([text[0], 1])
        for index in range(1, len(text)):
            if text[index] == text[index - 1]:
                segments_list[-1][1] += 1
            else:
                segments_list.append([text[index], 1])
        for segment_char, segment_length in segments_list:
            max_length = max(max_length, min(segment_length + 1, character_counts[ord(segment_char) - ord('a')]))
        for i in range(1, len(segments_list) - 1):
            if segments_list[i - 1][0] == segments_list[i + 1][0] and segments_list[i][1] == 1:
                max_length = max(max_length, min(segments_list[i - 1][1] + segments_list[i + 1][1] + 1,
                                                 character_counts[ord(segments_list[i - 1][0]) - ord('a')]))
        return max_length

18200