Practice Find Longest Special Substring That Occurs Thrice I
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Find Longest Special Substring That Occurs Thrice I
Problem Statement
You are given a string s that consists of lowercase English letters. A string is called special if it is made up of only a single character. For example, the string "abc" is not special, whereas the strings "ddd", "zz", and "f" are special. Return the length of the longest special substring of s which occurs at least thrice, or -1 if no special substring occurs at least thrice. A substring is a contiguous non-empty sequence of characters within a string.
Source: Find Longest Special Substring That Occurs Thrice I on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
s = "aaaa"
2
# Example 2
s = "abcdef"
-1
# Example 3
s = "abcaba"
1
Constraints
Related LeetCode Problems
Practice more problems similar to Find Longest Special Substring That Occurs Thrice I.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.