# Valid Palindrome II: Practice Notes

Valid Palindrome II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return whether s is a palindrome after deleting at most one character. Two pointers; on the first mismatch, try skipping either the left or the right character and check the rest.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Continuing after a mismatch without branching, or allowing more than one deletion.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://www.linkjob.ai/.