Solving Minimum Path Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7

See the full details of the problem Minimum Path Sum at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go