Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2330. 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.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early March, 2025
Meta
Senior
Mid January, 2025
Meta
Senior
Valid Palindrome 2: Determine if a string can be a palindrome by removing at most one character
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.