Slug: graph-comp-01 · Paired reading: Chapter 21
Prompt
fn count_components(n: usize, edges: &[(usize, usize)]) -> usize —
undirected connected components (DFS or Union-Find).
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? Get it on Amazon (US and other storefronts linked in the site footer) — the Preface access code unlocks this gym.
intermediate · order 137
Slug: graph-comp-01 · Paired reading: Chapter 21
fn count_components(n: usize, edges: &[(usize, usize)]) -> usize —
undirected connected components (DFS or Union-Find).