# Reachability Tree Directed Graphs: Interview Notes

Reachability Tree Directed Graphs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For incremental directed reachability or dominator-like queries, maintain a reachability forest that records a witness path from a designated source set.

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

Depends on the incremental model; often almost-linear with clever unions.

## Common mistake

Treating a reachability-tree parent as a graph edge that must exist, which is not required.

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