# Leetcode 680 - Valid Palindrome II

`Note:`

- DFS all the way. Use
`times`

as a param to record times we deleted chars. - Pair with double pointers.
- If
`left >= right`

return true. - If
`s[l] === s[r]`

then continue dfs. - If not,
- times >= 1 return false.
- Otherwise continue dfs with
`times + 1`

.

`Question:`

Given a string `s`

, return `true`

if the `s`

can be palindrome after deleting `at most one`

character from it.

`Example:`

1 | Input: s = "abca" |

`Code:`

1 | /** |