# Needleman Wunsch Global Align: Explained
Needleman Wunsch Global Align shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Fill a DP table where each cell is a diagonal substitution or an axis-aligned gap, then traceback from the bottom-right corner for a global alignment.
## 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 and space for sequences of length n and m (O(min(n, m)) space with Hirschberg).
## Common mistake
Initializing the first row and column to zero as in local alignment, which no longer penalizes leading gaps.
## 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 Linkjob.