Shortest Path in Binary Matrix

Question Explain

Given an $n \times n$ binary matrix `grid`, return the length of the shortest clear path from the top-left to the bottom-right corner. A clear path uses only cells with 0. Use BFS.