Friend Circles — Solution & Editorial

Back to the Problem

BFS/DFS from every unvisited node, or union-find; each start discovers one component.

Complexity: O(N + M)