Number of Connected Components (#323)
You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph.
Return the number of connected components in the graph.
Note: This is a premium LeetCode problem. The description is provided for educational purposes.
Company Tags: Google, Amazon
Core Concept: Graph, DFS/BFS, Union-Find