LeetCode in Kotlin
1624. Largest Substring Between Two Equal Characters
Easy
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: 0
Explanation: The optimal substring here is an empty substring between the two 'a's.
Example 2:
Input: s = “abca”
Output: 2
Explanation: The optimal substring here is “bc”.
Example 3:
Input: s = “cbzxy”
Output: -1
Explanation: There are no characters that appear twice in s.
Constraints:
1 <= s.length <= 300scontains only lowercase English letters.
Solution
class Solution {
fun maxLengthBetweenEqualCharacters(s: String): Int {
val lenS = s.length
val firstIndexesOf = IntArray(26) { -1 }
var longest = -1
for (idx in 0 until lenS) {
val idxCh = (s[idx] - 'a')
if (firstIndexesOf[idxCh] < 0) {
firstIndexesOf[idxCh] = idx
} else {
val len = idx - firstIndexesOf[idxCh] + 1 - 2
longest = maxOf(longest, len)
}
}
return longest
}
}