Graphs/Count Connected ComponentsMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Count Connected Components

Graphs·Medium

You have a graph of n nodes labeled 0 to n - 1. You are given an integer n and a list of undirected edges where edges[i] = [a, b] means there is an edge between nodes a and b.

Return the number of connected components in the graph.

Examples

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

Output: 2

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

Output: 1

Constraints

1 <= n <= 2000
1 <= edges.length <= 5000
edges[i].length == 2
0 <= a_i, b_i < n
a_i != b_i
There are no repeated edges.

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Graphs
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.