> the lowest sum possible that results from traversing a grid from one corner to the other, where the possible moves are going right, down or up by one. But, y

> the lowest sum possible that results from traversing a grid from one corner to the other, where the possible moves are going right, down or up by one. But, you just need the sum, not the path. There's no need for a shortest path strategy.