@@ -0,0 +1,622 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/longest-increasing-path-in-a-matrix/%0A */%0Apublic class Problem329 %7B%0A    public int longestIncreasingPath(int%5B%5D%5B%5D matrix) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem329 prob = new Problem329();%0A        System.out.println(prob.longestIncreasingPath(new int%5B%5D%5B%5D%7B%0A            %7B9, 9, 4%7D,%0A            %7B6, 6, 8%7D,%0A            %7B2, 1, 1%7D%0A        %7D)); // 4%0A        System.out.println(prob.longestIncreasingPath(new int%5B%5D%5B%5D%7B%0A            %7B3, 4, 5%7D,%0A            %7B3, 2, 6%7D,%0A            %7B2, 2, 1%7D%0A        %7D)); // 4%0A    %7D%0A%7D%0A

Create a skeleton for problem 329