# Connecting Cities With Minimum Cost: Practice Notes
Connecting Cities With Minimum Cost shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Kruskal or Prim on the bidirectional connections; if the MST cannot cover all n cities return -1, else return its cost.
## 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(E log E).
## Common mistake
Summing every connection instead of only the MST edges.
## 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 real-time interview help.