Strongly connected components
Given a directed graph on n nodes (0..n-1) with a list of directed edges, return the number of strongly connected components. Constraints: 1 <= n <= 10^5; edges may include self-loops and duplicates. Your solution must avoid Python recursion-depth issues on long chains.
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 35 min
solution.py
InputExpectedGot
[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]3not run yetsample