Swap For Longest Repeated Character Substring
You are given a string text. You can swap two of the characters in text.
Return the length of the longest substring with repeated characters.
Example 1
Input
text = "ababa"Output
3We can swap the first 'b' with the last 'a', or the last 'b' with the first 'a', making the longest repeated character substring "aaa" with length 3.
Example 2
Input
text = "aaabaaa"Output
6Swap 'b' with the last 'a' (or the first 'a'), and the longest repeated character substring is "aaaaaa" with length 6.
Constraints
- 1 <= text.length <= 2 * 10^4
- text consist of lowercase English characters only.