# Neighbor Joining Phylogeny: Walkthrough

Neighbor Joining Phylogeny shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Iteratively join the pair of taxa with the smallest corrected distance Q_ij, create a new node, and update distances so an additive tree is recovered.

## 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(n^3) for n taxa.

## Common mistake

Joining the raw closest pair instead of the Q-criterion pair, which fails to correct for distant rate variation and can yield the wrong topology.

## 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.