Palindrome After Deleting One Character
Determine if a string can be a palindrome after deleting at most one character.
Input: s = "abc"
Output: FALSE
Explanation: Deleting any single character leaves either "ab", "bc", or "ac", none of which result in a valid palindrome.

Question

Palindrome After Deleting One Character

Determine if a string can be a palindrome after deleting at most one character.

Input: s = "abc"

Output: FALSE

Explanation: Deleting any single character leaves either "ab", "bc", or "ac", none of which result in a valid palindrome.

Anonymous · Accepted Answer

for this one you really just need two pointers. start at the ends and move inward. the second they don't match, you just test if the rest of the string is a palindrome by either skipping the left char or skipping the right char.

public boolean validPalindrome(String s) {
    int left = 0, right = s.length() - 1;
    while (left < right) {
        if (s.charAt(left) != s.charAt(right)) {
            return checkPal(s, left + 1, right) || checkPal(s, left, right - 1);
        }
        left++; 
        right--;
    }
    return true;
}

private boolean checkPal(String s, int i, int j) {
    while (i < j) {
        if (s.charAt(i) != s.charAt(j)) return false;
        i++; 
        j--;
    }
    return true;
}

Palindrome After Deleting One Character

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions