← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
Given an m x n grid of non-negative integers, find a path from the top-left corner to the bottom-right corner that minimizes the sum of the numbers along the path. You may only move either down or right at any point in time. Return the minimum path sum.