package leetcode;

/**
 * https://leetcode.com/problems/minimum-falling-path-sum/
 */
public class Problem931 {
    public int minFallingPathSum(int[][] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem931 prob = new Problem931();
    }
}

package leetcode;

/**
 * https://leetcode.com/problems/minimum-falling-path-sum/
 */
public class Problem931 {
    public int minFallingPathSum(int[][] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem931 prob = new Problem931();
        System.out.println(prob.minFallingPathSum(new int[][]{
            {1, 2, 3},
            {4, 5, 6},
            {7, 8, 9}
        })); // 12
    }
}

Update problem 931