Q64 Minimum Path Sum
Q64 Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from
top left to 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.

robertzm/algotest