Number of Connected Components in an Undirected Graph — Medium Coding Interview Question

Given n nodes and undirected edges, return the number of connected components.

Example

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

Output: 2

Constraints

• 1 <= n <= 2000

Topics & Companies

Topics: graphs

Asked by: Amazon, Google

Optimal Solution Complexity

Time complexity: O(V). Space complexity: O(V).

Practice more

• All DSA Problems
• DSA Patterns