Watch 10 video solutions for Valid Palindrome III, a hard level problem involving String, Dynamic Programming. This walkthrough by NeetCode has 318,354 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given a string s and an integer k, return true if s is a k-palindrome.
A string is k-palindrome if it can be transformed into a palindrome by removing at most k characters from it.
Example 1:
Input: s = "abcdeca", k = 2 Output: true Explanation: Remove 'b' and 'e' characters.
Example 2:
Input: s = "abbababa", k = 1 Output: true
Constraints:
1 <= s.length <= 1000s consists of only lowercase English letters.1 <= k <= s.length