@@ -0,0 +1,450 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/minimum-path-sum/%0A */%0Apublic class Problem64 %7B%0A    public int minPathSum(int%5B%5D%5B%5D grid) %7B%0A    %09// TODO: to be implemented%0A        return 0;%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A%09%09Problem64 prob = new Problem64();%0A%09%09int%5B%5D%5B%5D grid = new int%5B%5D%5B%5D %7B%0A%09%09%09new int%5B%5D%7B1, 9, 4, 7%7D,%0A%09%09%09new int%5B%5D%7B6, 2, 1, 5%7D,%0A%09%09%09new int%5B%5D%7B1, 3, 8, 2%7D%0A%09%09%7D;%0A%09%09System.out.println(prob.minPathSum(grid));%0A%09%7D%0A%7D%0A

Create a skeleton for problem 64