Given a string s, return the maximum length of a substring such that every character occurs at most $2$ times within it.

Constraints:

• $2 \leq$ s.length $\leq 100$

• s consists only of lowercase English letters.

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.