CodingHardcod-g739

Subject GraphsLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development, Technology

Question

A microservice mesh has n services (0..n-1) and directed `edges` `[a, b]` meaning a can call b. A 'mutual cluster' is a maximal set of services in which every service can reach every other (directly or transitively). Return the number of mutual clusters. A single service with no cycle through it is its own cluster of size 1.

Implement

count_mutual_clusters(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.