Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· 2d-dp Mock interview

Minimum Path Sum

Given an m x n grid of non-negative numbers, find a path from the top-left to the bottom-right that minimizes the sum of numbers along it, moving only right or down. Return that minimum sum.

Examples

in: grid = [[1,3,1],[1,5,1],[4,2,1]]

out: 7

1->3->1->1->1

Constraints

1 <= m, n <= 200
0 <= grid[i][j] <= 100

Hints

target: O(m*n) time⌘↩ run · ⇧⌘↩ submit