# Tarjan Offline LCA With Union Find: Practice Notes
Tarjan Offline LCA With Union Find shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS the tree, union each finished subtree to its parent, and answer a query when its other endpoint is already visited via find on that endpoint.
## 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 + q) with union by rank and path compression, offline only.
## Common mistake
Answering a query before the other endpoint is marked visited.
## 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 help for online coding assessments.