3349. Maximum Length Substring With Two Occurrences
My accepted Python solution to LeetCode problem 3349, Maximum Length Substring With Two Occurrences, running in 7ms.
- Difficulty: Easy
- Python
- Runtime 7ms
- Memory 17.2MB
- Updated
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 7ms, memory 17.2MB, accepted 2026-01-02.
class Solution:
def maximumLengthSubstring(self, s: str) -> int:
count = {}
left = 0
max_len = 0
for right in range(len(s)):
count[s[right]] = count.get(s[right], 0) + 1
while count[s[right]] > 2:
count[s[left]] -= 1
left += 1
max_len = max(max_len, right - left + 1)
return max_len