# Gotoh Affine Gap Recurrence: Walkthrough
Gotoh Affine Gap Recurrence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep three DP matrices (match, gap-in-A, gap-in-B) so opening a gap costs more than extending it, using constant extra work per cell.
## 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(nm) time, same as linear-gap alignment.
## Common mistake
Adding the open penalty again on every extension step, which turns the affine cost back into a linear one with the wrong slope.
## 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 learn more.