Watch 10 video solutions for Valid Palindrome II, a easy level problem involving Two Pointers, String, Greedy. This walkthrough by NeetCode has 58,944 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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 <= 105s consists of lowercase English letters.