# Map Of Highest Peak: Practice Notes

Map Of Highest Peak shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A matrix of water (1) and land (0); assign heights so water is 0 and adjacent cells differ by at most 1, maximizing the highest height. Multi-source BFS from every water cell; the distance to the nearest water is the optimal height.

## 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(mn).

## Common mistake

Running a single-source BFS from one water cell, or assigning large heights on land without the differ-by-at-most-1 constraint.

## 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 assistant for technical interviews.