# Smith Waterman Local Align: Practice Notes
Smith Waterman Local Align shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Same recurrence as Needleman-Wunsch but with an extra zero option in every cell, and traceback from the globally maximum cell rather than the corner.
## 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.
## Common mistake
Allowing a cell to stay negative instead of resetting to zero, which reports a locally suboptimal alignment.
## 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 https://www.linkjob.ai/.