Periodic string check
Given a lowercase string s, determine whether it can be constructed by taking some proper substring of it and concatenating one or more copies of that substring together. Return true if so. 'abab' is true ('ab' twice); 'aba' is false; 'aaaa' is true. Length up to a few thousand.
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 25 min
solution.py
InputExpectedGot
["abab"]truenot run yetsample