# Greatest Common Divisor Traversal: Interview Notes
Greatest Common Divisor Traversal shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two indices are traversable when gcd of their values is > 1. Union each number to its prime factors (via a sieve). The graph is fully traversable iff every index ends up in one component.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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(A log A + n α(A)).
## Common mistake
Checking gcd of only adjacent pairs, which misses a long path through a shared factor.
## 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 AI interview assistant.