Skip to content

Practice Find Longest Special Substring That Occurs Thrice II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2982
LeetCode Problem

Find Longest Special Substring That Occurs Thrice II

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 II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "aaaa"
Output
2

# Example 2

Input
s = "abcdef"
Output
-1

# Example 3

Input
s = "abcaba"
Output
1

Constraints

3 <= s.length <= 5 * 10^5
s consists of only lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Find Longest Special Substring That Occurs Thrice II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.