# Kosaraju Strongly Connected Components: Practice Notes
Kosaraju Strongly Connected Components shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DFS once to get finish order, reverse all edges, then DFS in decreasing finish order; 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(V + E).
## Common mistake
Running the second pass on the original graph instead of the transpose.
## 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 real-time interview help.