Largest Substring Between Two Equal Characters
Given a string s, return the length of the longest substring between two equal characters, excluding the two characters. If there is no such substring, return -1.
A substring is a contiguous sequence of characters within a string.
Example 1
Input
s = "aa"Output
0The optimal substring here is an empty substring between the two 'a's.
Example 2
Input
s = "abca"Output
2The optimal substring here is "bc".
Constraints
- 1 <= s.length <= 300
- s contains only lowercase English letters.
Asked at 1 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.