Leetcode 2981. Find Longest Special Substring That Occurs Thrice I

Find the maximum length L such that a substring made of a single repeated character (a "special" string like "aaa") appears at least three times in s (overlaps allowed); return -1 if no such single-character substring occurs three times.