# Delete Operation For Two Strings: Practice Notes
Delete Operation For Two Strings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The minimum deletions equal len(a) + len(b) - 2 * LCS(a, b). Compute LCS with a rolling one-dimensional DP.
## 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(mn).
## Common mistake
Treating it like edit distance with substitutions allowed.
## 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.