Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2981. Find Longest Special Substring That Occurs Thrice I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source