Longest repeating substring length
Given a string s, find the length of the longest substring that occurs at least twice in s (occurrences may overlap). Return 0 if no character repeats. 1 <= len(s) <= 30000, lowercase letters. Aim for better than O(n^2) substring enumeration.
Implement
longest_repeated_substring_len(s: str) → intExamples
in
["banana"]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
["banana"]3not run yetsample