# Nearest Exit From Entrance In Maze: Study Guide

Nearest Exit From Entrance In Maze shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS from the entrance through empty cells; the first time you reach a border cell that is not the entrance itself is the nearest exit.

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

Counting the entrance as an exit when it already sits on the border.

## 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 best AI tool for coding tests and OAs.