Longest palindrome linear time
Given a string s, return the LENGTH of the longest palindromic substring (contiguous). Solve it in O(n) time. 1 <= len(s) <= 100000, lowercase letters. Example: 'forabccddccbafor' -> 10 ('abccddccba').
Implement
longest_palindrome_len(s: str) → intExamples
in
["forabccddccbafor"]out10What 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 36 min
solution.py
InputExpectedGot
["forabccddccbafor"]10not run yetsample