Leetcode 1926. Nearest Exit from Entrance in Maze

Given a grid maze with walls ('+') and empty cells ('.'), find the minimum number of up/down/left/right moves from the given entrance to the nearest exit (an empty border cell, excluding the entrance). This is a shortest-path problem on a grid, typically solved with BFS to return the distance to the nearest exit or -1 if none is reachable.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late February, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1926. Nearest Exit from Entrance in Maze

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact