# As Far From Land As Possible: Interview Notes

As Far From Land As Possible shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Multi-source BFS from every land cell across the water; the last water cell you reach is the farthest from land (or -1 if there is no water or no land).

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

## Common mistake

A separate BFS from every water cell, which is O((mn)^2).

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