Grid paths with obstacles
Mediumdynamic programmingmatrix
A 1 in the grid is an obstacle. Moving only right or down, return how many different paths lead from the top-left cell to the bottom-right cell.
Example 1
Input: grid = [[0,0,0],[0,1,0],[0,0,0]] Output: 2
Example 2
Input: grid = [[0,1],[0,0]] Output: 1
Constraints
- 1 ≤ rows, cols ≤ 30
- Each cell is 0 or 1
- The answer fits in 64 bits
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[][]} grid
* @return {long}
*/
function uniquePathsWithObstacles(grid) {
}