324. Shortest Path in Binary Matrix

MediumBFS

Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that all the visited cells of the path are 0, and all the adjacent cells of the path are 8-directionally connected. The length of a clear path is the number of visited cells of this path.

Examples

Input: [[0,0,0],[1,1,0],[1,1,0]]

Output: 4

Explanation: The shortest 8-connected clear path has 4 cells.

Constraints

n == grid.length
n == grid[i].length
1 <= n <= 100
grid[i][j] is 0 or 1

Run checks all cases above. Submit evaluates all test cases.