Valid Palindrome II

Try to solve the Valid Palindrome II problem.

We'll cover the following

Statement

Write a function that takes a string as input and checks whether it can be a valid palindrome by removing at most one character from it.

Constraints:

  • 1≤1 \leq string.length ≤\leq 10510^5

  • The string only consists of English letters.

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy