Skip to interview prep
Apexed

61. Number of Connected Components (Union-Find)

MediumDisjoint sets

There are n nodes labelled 0 to n − 1 and a list of undirected edges. Return the number of connected components.

Example 1

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

Constraints

  • 1 ≤ n ≤ 2000

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Run checks these cases; the expected output comes from the reference solution. Submit judges all 4 hidden and sample tests.

Code runs only in your browser in an isolated sandbox. Progress and submissions are saved on this device.

Number of Connected Components (Union-Find) — coding interview practice — Apexed