Solving Shortest Path in a Binary Matrix

Statement Given a binary matrix, we need to find the length of the shortest path from the top-left cell to the bottom-right cell. We can only move in four directions: up, down, left, and right. Additionally, we can only traverse through cells that c...