CodingHardcod-g237

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

Question

Given a directed graph with n nodes (0..n-1) and a list of directed edges [u, v], return the number of nodes in the largest strongly connected component. A single node with no edges is its own component of size 1. Constraints: 1 <= n <= 2000; self-loops and parallel edges may appear.

Implement

largest_scc_size(n: int, edges: list[list[int]]) → int

Examples

in[5,[[0,1],[1,2],[2,0],[1,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.