Practice Minimum Path Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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. Note: You can only move either down or right at any point in time.
Source: Minimum Path Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
grid = [[1,3,1],[1,5,1],[4,2,1]]
Output
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
Related LeetCode Problems
Practice more problems similar to Minimum Path Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.