Given a square binary matrix grid of size n x n, find the length of the shortest clear path from the top left cell to the bottom right cell.

A clear path is a sequence of cells such that every visited cell has value $0$. The path starts at grid[0][0] and ends at grid[n-1][n-1]. Return the number of cells in the shortest such path. If no clear path exists, return $-1$.

Note: Movement is allowed to any of the $8$ neighboring cells (horizontal, vertical, and diagonal).

Constraints:

• n == grid.length

• n == grid[i].length

• $1 \leq$ n $\leq 100$

• grid[i][j] is $0$ or $1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.