Loading problem…
Given a string `s`, return `true` if the `s` can be a palindrome after deleting **at most one** character from it.
Example 1
Input: s = aba
Output: true
Explanation: Already a palindrome — zero deletions needed.
Example 2
Input: s = abca
Output: true
Explanation: Delete 'c' (or 'b') to get "aba", a palindrome.
Example 3
Input: s = abc
Output: false
Explanation: No single deletion makes it a palindrome.
Walk two pointers inward while characters match. At the first mismatch you get exactly one deletion — either skip the left character or the right one — so check whether the remaining inner substring is a plain palindrome in either case.
Run checks all cases above. Submit evaluates all test cases.