dsa9 min read
Tarjan's Algorithm — Strongly Connected Components in Linear Time [Google, Meta, Uber]
Master Tarjan's SCC algorithm: a single DFS pass with discovery times, low-link values, and an explicit stack to identify all strongly connected components in O(V + E). The interview gold standard for directed graph decomposition, asked at Google, Meta, and Uber.
Read →