Exam results dataset, variant 36. Count connected components in an undirected graph with vertices `0..n-1`. Implement `solve(n, edges)` and return the requested value.
DrawCode Practice Problem
Connected Components · Exam results 36
Interactive Visualizer Workspace
Explore step-by-step interactive animations, memory state tracking, and live multi-language execution in DrawCode.
Launch Interactive Visualizer