Minimum path sum
Mediumdynamic programmingmatrix
Start at the top-left cell and move only right or down to the bottom-right cell. Return the smallest possible sum of the numbers along the way.
Example 1
Input: grid = [[1,3,1],[1,5,1],[4,2,1]] Output: 7
1 → 3 → 1 → 1 → 1 = 7.
Example 2
Input: grid = [[1,2,3],[4,5,6]] Output: 12
Constraints
- 1 ≤ rows, cols ≤ 200
- 0 ≤ grid[r][c] ≤ 200
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[][]} grid
* @return {int}
*/
function minPathSum(grid) {
}