# 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

Build an MST on wells-plus-pipes: add a virtual node 0 connected to each house i with an edge of cost wells[i], then run Kruskal/Prim on those edges plus the pipes. The 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(E log E).

## Common mistake

Deciding well-vs-pipe per house greedily without a global MST, which can pick a cheap well that blocks a cheaper pipe network.

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