# Min Cost To Connect All Points: Walkthrough

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

Prim or Kruskal on the complete graph of Manhattan distances; MST cost is the answer.

## 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^2 log n) Prim with a heap, or O(n^2).

## Common mistake

Using Euclidean distance when the problem asks for Manhattan.

## 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 learn more.