// Minimum Path Sum — MEDIUM

// Category: dynamic-programming

Given a `m x n` grid filled with non-negative numbers, find a path from the top-left to the 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.

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

Output: 7