Medium · Graphs

Shortest Path in Binary Matrix

Given an n × n binary matrix grid, return the length of the shortest clear path from the top-left cell to the bottom-right cell, counted in cells, where a clear path uses only 0-cells and moves between cells that share an edge or a corner. Return −1 if no clear path exists.

{
  "grid": [
    [0, 0, 0],
    [1, 1, 0],
    [1, 1, 0]
  ]
}

{
  "grid": [
    [0, 1, 0],
    [0, 1, 0],
    [0, 0, 0]
  ]
}