# Heavy Path Decomposition LCA: Walkthrough
Heavy Path Decomposition LCA shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
After assigning heavy paths, lift the deeper node up to the same path depth as the other, then walk both heads until they meet; the meeting node is the LCA.
## 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 n) per LCA after O(n) setup.
## Common mistake
Comparing node depths instead of chain-head depths when deciding which head to lift.
## 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 real-time AI interview assistant for live interviews.