Make a String Palindromic with at Most K Deletions

Read the full interview experience this question came from →

Quick Overview

Decide whether deleting at most k characters can turn a string into a palindrome while preserving order. Explore memoized two-pointer choices, matching-end shortcuts, and the connection to minimum-deletion dynamic programming.

Make a String Palindromic with at Most K Deletions

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Decide whether deleting at most k characters can turn a string into a palindrome while preserving order. Explore memoized two-pointer choices, matching-end shortcuts, and the connection to minimum-deletion dynamic programming.

Read the full Meta Software Engineer interview experience this question came from

|Home/Coding & Algorithms/Meta
Meta logo
Meta
Aug 8, 2026
mediumSoftware EngineerOnsiteCoding & Algorithms
5
0
Loading...

Submit Your Answer to Earn 20XP

Sign in to leave a comment

Loading comments...