# Minimum Insertion Steps To Make A String Palindrome: Practice Notes
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 fewest insertions equal n minus the length of the longest palindromic subsequence (you insert the missing counterparts of the letters the LPS drops).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n^2).
## Common mistake
Counting replacements instead of insertions, or computing longest palindromic substring (contiguous) instead of subsequence.
## 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 assistant for technical interviews.