← Meta questions
CodingReported in a candidate post, Nov 2025

Palindrome after deleting certain characters

Filed under Meta

Given a string s and an integer k, determine whether s can be turned into a palindrome by deleting at most k characters. (When k = 1 this is the classic Valid Palindrome II problem.) The source said…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Meta questions

Collected from public candidate posts and coding forums. Updated Nov 2026.