Practice Problem

Minimum Path Sum

Difficulty: Medium

Given an m x n grid filled with non-negative numbers, find a path from the top-left to the bottom-right that minimizes the sum of all numbers along the path.