Solo practice workspace

Interview Coder drill

Number of Connected Components in an Undirected Graph

20:00

Medium

Number of Connected Components in an Undirected Graph is a Blind 75 Graphs drill for Interview Coder. Runnable stdin/stdout tests have not been added yet.

Constraints

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Graphs BFS/DFS pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...

Loading Problem

Number of Connected Components in an Undirected Graph

Recall before you code