Given `n` nodes labeled `0..n-1` and an undirected `edges` list of `[a, b]` pairs, implement `countComponents(n, edges)` returning the number of connected components.
+ 1 hidden test run on Submit.
Counting DFS launches over unvisited nodes gives the component count in O(V + E).
Run your code to see results.