# Number Of Operations To Make Network Connected: Study Guide
Number Of Operations To Make Network Connected shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
If you have fewer than n-1 cables you cannot connect n machines. Otherwise Union-Find and the extra edges equal components-1 operations.
## 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, Dijkstra, Union-Find, or interval 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).
## Common mistake
Returning the raw number of extra edges without checking you have enough cables overall.
## 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 interview copilot app.