# Rollback DSU Time Travel: Study Guide
Rollback DSU Time Travel shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store every parent and rank change on a stack and pop them to restore a previous DSU state after a recursive search returns.
## 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(1) extra per union with union-by-size or rank, no path compression.
## Common mistake
Path-compressing during a rollbackable phase, which creates changes that are hard to invert in order.
## 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 copilot.