Longest prefix-suffix match
Given a lowercase string s, return the length of the longest proper prefix of s that is also a suffix of s (a proper prefix excludes the whole string). For 'ababab' the answer is 4 ('abab'). For 'abcdef' it is 0. Length up to a few thousand.
Implement
longest_prefix_suffix(s: str) → intExamples
in
["ababab"]out4What 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
["ababab"]4not run yetsample