Maze Solver: Shortest Path

Given a 2D maze, compute the minimum number of moves needed to travel from a start cell to a target cell.

The maze contains 0s and 1s:

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input

Execution Result: