Delete one palindrome
Given a lowercase string s, return True if it can be made into a palindrome by deleting at most one character (deleting zero characters is allowed, so any palindrome qualifies). The string length is at least 1.
Implement
valid_palindrome_one_del(s: str) → boolExamples
in
["aba"]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
["aba"]truenot run yetsample