Shortest Path in Binary Matrix

In an n x n grid of 0s and 1s, find the length of the shortest clear path from the top-left to the bottom-right cell. A clear path only uses 0 cells and may move in all 8 directions. The length is the number of cells visited. Print -1 if no path exists.

1 <= n <= 100