Given a string s, a substring is called special if it is made up of only one repeated character.

Return the maximum possible length of a special substring that appears in s at least three times. If no special substring occurs at least three times, return -1.

Note: Occurrences are counted by substring positions in s, and they may overlap.

Constraints:

• $3 \leq$ s.length $\leq 50$

• s consists of only lowercase English letters.

Input: s = "zzzzzz"-str
Output: 4-int
Explanation: The special substring "zzzz" appears 3 times (positions 0–3, 1–4, and 2–5), and no longer special substring can appear at least three times in a length-6 run.

Input: s = "abacadaeaf"-str
Output: 1-int
Explanation: Any length-2 special substring would require two identical adjacent letters, which doesn’t occur. Single-letter substrings like "a" occur many times, so the maximum length is 1.

Input: s = "bbccddeeffgghhiijjkkllmmnnooppqqrrssttuuvvwwxxyyzz"-str
Output: -1-int
Explanation: Each letter appears only in pairs (e.g., "bb", "cc"). A length-1 special substring occurs only twice for each character, and a length-2 one occurs once, so nothing appears at least three times.

Input: s = "aaabaaaacaa"-str
Output: 3-int
Explanation: The special substring "aaa" appears at least three times (e.g., positions 0–2, 4–6, and 5–7), and no length-4 special substring appears three times.

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.