Minimum Path Sum | Dynamic Programming #6520
Description
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
Input: M x N grid
Output: Path with minimum sum of its numbers
Eg:
Input: grid = [[1,8,1], [2,6,9], [4,3,1]]
Output: 11
Explanation: Because the path 1 → 2 → 4 → 3 → 1 minimizes the sum.