Minimum Path Sum

Given an m×n grid filled with non-negative integers, find a path from the top-left to the bottom-right that minimizes the sum of all numbers along the path. You can only move right or down.

Enable JavaScript for the full StreamPrep guide.