Shortest Path in a Grid with Obstacles Elimination

bloomberg

Given an m × n binary matrix grid:

  • 0 is an empty cell that can be traversed.
  • 1 is an obstacle.
  • The start is (0, 0) and the destination is (m - 1, n - 1).

In one step, you may move ...

Example

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: