Given n nodes and a list of undirected edges, return the number of connected components.
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
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features