Leetcode Problem 1036. Escape a Large Maze

1036. Escape a Large Maze

Leetcode Solutions

Create a hash set to store the blocked cells for quick access.
Define the escape distance based on the number of blocked cells.
Implement a BFS function that takes the current position and the target position as arguments.
In the BFS function, use a queue to store the cells to be visited and a set to keep track of visited cells.
Dequeue a cell from the queue, and for each of its four neighboring cells, check if it is within bounds, not blocked, and not visited.
If the neighboring cell is the target, return true.
If the number of steps exceeds the escape distance, return true as well.
If none of the neighboring cells can be visited, return false.
Call the BFS function for both the source to target and target to source to ensure that the path is not blocked from either side.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen