# Min Cost To Connect All Points: Practice Notes
Min Cost To Connect All Points shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
MST on the complete graph of Manhattan distances: Prim with a min-heap of unused points (or Kruskal plus Union-Find on the sorted edges). The total MST weight is the min cost.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n^2 log n) Prim.
## Common mistake
Connecting every point to the nearest unused point without the MST check (a greedy that can cycle or miss a cheaper global edge).
## 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 interview helper that uses your resume.