Largest Substring Between Two Equal Characters LeetCode solution in Python

1
class Solution:
2
def maxLengthBetweenEqualCharacters(self, s: str) -> int:
3
last, ans = {}, -1
4
for i, c in enumerate(s):
5
if c not in last:
6
last[c] = i
7
else:
8
ans = max(ans, i - last[c] - 1)
9
return ans

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0