# Heavy Light Decomposition Path Queries: Explained
Heavy Light Decomposition Path Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Decompose the tree into heavy paths, map each path to a segment tree interval, and climb light edges so a path uses O(log^2 n) nodes.
## 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(log^2 n) per path query or update.
## Common mistake
Lifting the deeper node first without comparing chain heads, which walks the wrong heavy path.
## 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 tool for job interviews.