Minimum Path Sum

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.

Return the minimum sum path from the top left to the bottom right of the grid.

Note: You can only move either down or right at any point in time.

Input Format:

First Parameter: A grid having m*n integers.

Output Format:

Return the number

Example 1

Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.

Example 2

Input: grid = [[1,2,3],[4,5,6]]
Output: 12

Constrains;

• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 200
• 0 <= grid[i][j] <= 100
• Expected Time Complexity: O(m * n)
• Expected Space Complexity: O(1)