Palindrome with deletion
Given a string s of lowercase letters, decide whether it can be turned into a palindrome by deleting at most one character. Return True if it can, False otherwise. For example, 'abca' is true: deleting 'b' or 'c' leaves a palindrome. The empty string and single characters already count as palindromes.
Implement
almost_palindrome(s: str) → boolExamples
in
["abca"]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 15 min
solution.py
InputExpectedGot
["abca"]truenot run yetsample