# Edit Distance: Walkthrough

Edit Distance shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Classic DP: dp[i][j] is the min inserts/deletes/replaces to turn word1[:i] into word2[:j]; a match copies dp[i-1][j-1], otherwise 1 plus the min of the three edits.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, 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(nm).

## Common mistake

A greedy left-to-right replace that cannot recover from an early mismatch.

## 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 the Linkjob AI app.