
Valid Palindrome II (easy)
Problem Statement
Given string s, determine whether it's possible to make a given string palindrome by removing at most one character.
A palindrome is a word or phrase that reads the same backward as forward.
Examples
-
Example 1:
- Input:
"racecar" - Expected Output:
true - Justification: The string is already a palindrome, so no removals are needed.
- Input:
-
Example 2:
- Input:
"abccdba" - Expected Output:
true - Justification: Removing the character 'd' forms the palindrome "abccba".
- Input:
-
Example 3:
- Input:
"abcdef" - Expected Output:
false - Justification: No single character removal will make this string a palindrome.
- Input:
Constraints:
- 1 <= s.length <= 10<sup>5</sup>
strconsists of lowercase English letters.
Try it yourself
Try solving this question here:
Python3
Python3
. . . .
.....
.....
.....
Unlock this and all other premium problems.
No code editor for this lesson
This lesson focuses on concepts and theory