Check Whether Deleting at Most K Characters Can Form a Palindrome
Company: Meta
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Onsite
Overview: Determine whether deleting at most k characters can turn a string into a palindrome, including the special case where k = 1. Then handle the general case for strings up to 2,000 characters and explain correctness, edge cases, and time-space trade-offs.