Valid palindrome with deque scan
Given a string s, determine whether it is a palindrome considering only alphanumeric characters and ignoring case and all other characters. Implement the check using a two-ended (front/back) scan as one would with a deque. Return True or False. The string has length 0 to 2*10^5 and may contain any printable ASCII characters.
Implement
is_clean_palindrome(s: str) → boolExamples
in
["A man, a plan, a canal: Panama"]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
["A man, a plan, a canal: Panama"]truenot run yetsample