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.