Count strongly connected components
Given a directed graph with n nodes (0..n-1) and a list of directed edges [u, v], return the number of strongly connected components (maximal sets of mutually reachable vertices). Isolated nodes each count as their own component. Assume 1 <= n <= 10000; use an O(n+m) SCC algorithm (Kosaraju or Tarjan) and avoid Python recursion-depth issues.
Implement
count_sccs(n: int, edges: list[list[int]]) → intExamples
in
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]3not run yetsample