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