Minimum Path Sum — C# Coding Problem
Difficulty: medium | Category: dynamic-programming
Problem Description
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.
Examples
Example 1
Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Path: 1 → 3 → 1 → 1 → 1
Example 2
Input: grid = [[1,2,3],[4,5,6]]
Output: 12