Valid Palindrome IV

Given a string s and an integer k, determine whether s can be transformed into a palindrome by deleting at most k characters — equivalently, whether its longest palindromic subsequence has length at least n − k. This typically requires dynamic programming or two‑pointer recursion with memoization to handle the n^2 subproblems.