# Tarjan SCC Lowlink: Interview Notes
Tarjan SCC Lowlink shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS the graph, record discovery times, and compute lowlink values so a node whose lowlink equals its discovery time is the root of a newly finished strongly connected component.
## 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 + m).
## Common mistake
Updating lowlink from a cross edge to an already-finished component, which can merge two distinct SCCs.
## 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 Linkjob AI interview assistant.