# Optimize Water Distribution In A Village: Explained

Optimize Water Distribution In A Village shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Add a virtual well node 0 connected to each house by wells[i], then run Kruskal/Prim on that graph; the MST cost is the min pipes-plus-wells plan.

## 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

Building a well in every house and ignoring that a cheap pipe can share one well.

## 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 tool for job interviews.