Problem · String
Validate a Palindrome After Limited Deletions
Learn this problemProblem statement
Given a string s and a nonnegative integer k, return true if deleting at most k characters can make s a palindrome. The remaining characters keep their original order.
The empty string and every one-character string are palindromes. Character comparisons are case-sensitive.
Function
isValidPalindrome(s: String, k: int) → booleanExamples
Example 1
s = "abca"k = 1return = trueDelete either b or c to obtain a palindrome.
Example 2
s = "abcdeca"k = 2return = trueDeleting b and e leaves acdca.
Example 3
s = "abc"k = 1return = falseDeleting one character leaves two different characters.
Constraints
kis nonnegative.smay be empty.- The input is compared as a sequence of case-sensitive characters.