Longest palindromic substring
Given a string s (0 <= len(s) <= 10^5) of printable ASCII characters, return the LENGTH of the longest palindromic substring (contiguous). Return 0 for the empty string.
Implement
longest_palindromic_substring_len(s: str) → intExamples
in
["babad"]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 25 min
solution.py
InputExpectedGot
["babad"]3not run yetsample