Minimum Path Sum
Find the minimum path sum from top-left to bottom-right in a grid.
Input: grid = [[1,2,3],[4,5,6]]
Output: 12
Explanation: The optimal path moves along 1 - 2 - 3 - 6, resulting in a minimum accumulated sum of 12.

Question

Find the minimum path sum from top-left to bottom-right in a grid.

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

Output: 12

Explanation: The optimal path moves along 1 -> 2 -> 3 -> 6, resulting in a minimum accumulated sum of 12.