Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. You can only move either down or right at any point in time.

30:00

Minimum Path Sum
medium
Topics
Companies

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. You can only move either down or right at any point in time.

Example 1:
Input: [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Constraints:

  • m==grid.lengthm == \text{grid.length}

  • n==grid[i].lengthn == \text{grid}[i].\text{length}

  • 1≤m,n≤2001 \leq m, n \leq 200

  • 0≤grid[i][j]≤2000 \leq \text{grid}[i][j] \leq 200

Input
arr =[[1,3,1],[1,5,1],[4,2,1]]
Grid

1

3

1

1

5

1

4

2

1

DP Table (Min Path Sum)

0

0

0

0

0

0

0

0

0

Initialize DP array

Variables
VariableValue
m3
n3
DepthFunction Call
Stack empty
0/14