CodingHardcod-g703

Subject Strongly connected componentsLevel Senior~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]]) → int

Examples

in[5,[[0,1],[1,2],[2,0],[2,3],[3,4]]]out3

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

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.