🧠 Before you code — what pattern fits?
You are given an m x n maze of "." (empty) and "+" (wall), and the entrance cell. An exit is an empty cell on the border that is not the entrance. Return the number of steps in the shortest path to the nearest exit, or -1.
maze [["+","+",".","+"],[".",".",".","+"],["+","+","+","."]], entrance [1,2] → 1
🎬 Video explanation · codestorywithMIK
Your solution runs against 3 unit tests, including edge and large-value cases.
Loading...
Test console · 3 unit tests
Submit your code to run it against all 3 unit tests. Results appear here.
JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.