You are given a string s that contains only lowercase English letters.

A substring of s is called special if it is composed of only a single distinct character.

Return the length of the longest special substring of s that appears at least $3$ times, or $-1$ if no such substring exists.

Constraints:

• $3 \leq$ s.length $\leq 5 imes 10^5$

• s consists of only 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.