Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.