Leetcode Problem 63. Unique Paths II

63. Unique Paths II

Leetcode Solutions

Check if the starting cell (0,0) is an obstacle. If yes, return 0 as no path is possible.
Set the value of the starting cell to 1 if it is not an obstacle.
Iterate over the first row. If a cell is not an obstacle, set its value to the value of the cell to its left.
Iterate over the first column. If a cell is not an obstacle, set its value to the value of the cell above it.
For the rest of the grid, iterate over each cell. If a cell is not an obstacle, set its value to the sum of the values of the cell above it and the cell to the left of it.
The value at the bottom-right corner of the grid is the number of unique paths to reach that cell.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen