Codemia | Master System Design Interviews Through Active Practice

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.

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.

Example 1:

Input: [[1,3,1],[1,5,1],[4,2,1]]

Output: 7

Input

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

Grid

1

3

1

5

1

4

2

1

DP Table (Min Path Sum)

0

Initialize DP array

Variables

Variable	Value
m	3
n	3

DepthFunction Call

Stack empty

0/14