# Minimum Insertion Steps To Make A String Palindrome: Study Guide

Minimum Insertion Steps To Make A String Palindrome shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The answer is n minus the longest palindromic subsequence: you only insert the missing counterpart of each unmatched character.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2).

## Common mistake

Counting deletions instead of insertions without noticing they are the same number.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.