#1274Medium· asked at 8 companies
Minimum Path Sum
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: grid = [[1,3,1],[1,5,1],[4,2,1]] Output: 7
The path 1 -> 3 -> 1 -> 1 -> 1 sums to 7.
Example 2
Input: grid = [[1,2,3],[4,5,6]] Output: 12
Constraints
- •
m == grid.length - •
n == grid[i].length - •
1 <= m, n <= 200 - •
0 <= grid[i][j] <= 200