problem680

README

< Previous 　　　　　　　　　　　　　　　　 Next >

680. Valid Palindrome II (Easy)

Given a string s, return true if the s can be palindrome after deleting at most one character from it.

 

Example 1:

Input: s = "aba"
Output: true

Example 2:

Input: s = "abca"
Output: true
Explanation: You could delete the character 'c'.

Example 3:

Input: s = "abc"
Output: false

 

Constraints:

• 1 <= s.length <= 105
• s consists of lowercase English letters.

Related Topics

[Greedy] [Two Pointers] [String]

Similar Questions

1. Valid Palindrome (Easy)