Optimal Commute Grid

Optimal Commute Grid

Given an m × n binary grid grid:

  • 0 represents a passable road.
  • 1 represents an impassable obstacle.

You commute from the top-left cell (0, 0) to the bottom-rig...

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: