Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

1746. Largest Substring Between Two Equal Characters

My accepted Python solution to LeetCode problem 1746, Largest Substring Between Two Equal Characters, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 0ms, memory 17.2MB, accepted 2025-12-31.

python
class Solution:
    def maxLengthBetweenEqualCharacters(self, s: str) -> int:
        first_occurrence = {}
        max_length = -1
        
        for i, char in enumerate(s):
            if char in first_occurrence:
                max_length = max(max_length, i - first_occurrence[char] - 1)
            else:
                first_occurrence[char] = i
        
        return max_length

Source