Given a string text, you are allowed to swap any $2$ characters at most $1$ time.

Return the maximum length of a contiguous substring consisting of identical characters that can be obtained.

Constraints:

• $1 \leq$ text.length $\leq 2 \cdot 10^4$

• text consists of lowercase English characters only.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.