Leetcode Problem 2290. Minimum Obstacle Removal to Reach Corner

2290. Minimum Obstacle Removal to Reach Corner

Leetcode Solutions

Initialize a 2D array distance with infinity to store the minimum number of obstacles removed to reach each cell.
Set distance[0][0] to 0 since the starting cell does not require any obstacles to be removed.
Create a deque and add the starting cell (0, 0) to it.
While the deque is not empty, pop the cell from the front of the deque.
If the current cell is the bottom-right corner, return the distance to this cell as the result.
For each of the four possible directions (up, down, left, right), calculate the new cell coordinates.
If the new cell is within bounds and has not been visited, update its distance if the current path offers a lower number of obstacles removed.
Depending on whether the new cell is an obstacle or not, add it to the front or back of the deque.
Continue this process until the deque is empty or the bottom-right corner is reached.
Return the distance to the bottom-right corner as the minimum number of obstacles to remove.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen