# Sequence Reconstruction: Walkthrough
Sequence Reconstruction shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a graph of consecutive pairs from the seqs and run Kahn; the unique topological order must equal org, so every step has indegree-zero count of exactly one.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n + sum seq lengths).
## Common mistake
Only checking that org is a valid topo order, which does not prove it is the only one.
## 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 learn more.