# Count The Number Of Complete Components: Practice Notes

Count The Number Of Complete Components shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each component, it is complete iff edges == v*(v-1)/2 (careful with undirected double counting).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n+e).

## Common mistake

Checking only that every degree equals v-1 without isolating the component first.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.