Status: IN
Valid Palindrome II handles the "at most one deletion" constraint by forking exactly once on the first mismatch (try skipping left or right), with no backtracking, keeping total work at O(n).
Source: entries/2026/06/06/valid-palindrome-ii-solution.md
JSON