LeetCode 1091 Shortest Path in Binary Matrix - Problem Statement

Problem: Shortest Path in Binary Matrix (LeetCode $1091$). You have an $n \times n$ grid where each cell is $0$ (clear) or $1$ (blocked). Find the shortest path from the top-left corner to the bottom-right corner. You can move in $8$ directions: up, down, left, right, and diagonals.

Return the length of the shortest clear path, or $-1$ if no path exists. This is a grid BFS problem. Each cell is a node. Adjacent cells are neighbors. Run BFS starting from $(0, 0)$ and stop when you reach $(n-1, n-1)$.