Leetcode Problem 1091. Shortest Path in Binary Matrix

1091. Shortest Path in Binary Matrix

Leetcode Solutions

Check if the starting cell (0, 0) is blocked (contains a 1); if so, return -1.
Initialize a queue to hold cells to explore and enqueue the starting cell with a distance of 1.
While the queue is not empty: a. Dequeue the front cell from the queue. b. If the cell is the bottom-right cell, return the distance. c. Otherwise, iterate over all 8 possible directions from the current cell. d. For each direction, check if the neighbor cell is within bounds, open, and unvisited. e. If valid, mark the neighbor as visited, record the distance, and enqueue it.
If the queue is empty and the bottom-right cell has not been reached, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen