1764. Maximum Repeating Substring
My accepted Python solution to LeetCode problem 1764, Maximum Repeating Substring, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.5MB
- 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 0ms, memory 17.5MB, accepted 2025-12-30.
class Solution:
def maxRepeating(self, sequence: str, word: str) -> int:
k = 0
while word * (k + 1) in sequence:
k += 1
return k