Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· graphs Mock interview

Number of Connected Components

Given `n` nodes labeled 0..n-1 and a list of undirected `edges`, return the number of connected components in the graph.

Examples

in: n = 5, edges = [[0,1],[1,2],[3,4]]

out: 2

{0,1,2} and {3,4}

Constraints

1 <= n <= 2000
0 <= len(edges) <= n*(n-1)/2

Hints

target: O(V + E) time⌘↩ run · ⇧⌘↩ submit