Repeated substring pattern
Given a non-empty string s of lowercase letters (1 <= len(s) <= 10^4), return True if s can be constructed by taking some proper substring of it and concatenating two or more copies of that substring; otherwise return False.
Implement
repeated_substring_pattern(s: str) → boolExamples
in
["abab"]outtrueWhat 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 20 min
solution.py
InputExpectedGot
["abab"]truenot run yetsample