# Kosaraju Two Pass SCC: Study Guide

Kosaraju Two Pass SCC shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS the graph to compute a finishing-time order, then DFS the transposed graph in decreasing finishing time so each tree is one SCC.

## 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

Running the second DFS in increasing rather than decreasing finishing time, which can put several SCCs into one tree.

## 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.