99. Number of Connected Components in an Undirected Graph

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: 2

Explanation: Nodes 0, 1, and 2 are connected, and nodes 3 and 4 are connected. There are two connected components.

Example 2:

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

Output: 1

Explanation: All nodes are connected in a single component.

Example 3:

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

Output: 1

Explanation: Nodes 0, 1 and 2 are all connected to each other forming 1 connected component.

Constraints:

•
•
•
•
•
•

Time Complexity

O(V + E)

Space Complexity

O(V + E)

99. Number of Connected Components in an Undirected Graph

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

99. Number of Connected Components in an Undirected Graph

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases