package leetcode;

/**
 * https://leetcode.com/problems/largest-submatrix-with-rearrangements/
 */
public class Problem1727 {
    public int largestSubmatrix(int[][] matrix) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1727 prob = new Problem1727();
        System.out.println(prob.largestSubmatrix(new int[][]{
            {0,0,1},{1,1,1},{1,0,1}
        })); // 4
        System.out.println(prob.largestSubmatrix(new int[][]{
            {1,0,1,0,1}
        })); // 3
        System.out.println(prob.largestSubmatrix(new int[][]{
            {1,1,0},{1,0,1}
        })); // 2
        System.out.println(prob.largestSubmatrix(new int[][]{
            {0,0},{0,0}
        })); // 0
    }
}

@@ -471,32 +471,160 @@
 ix(new int%5B%5D%5B%5D%7B%0A
+            %7B0,0,1,1,1%7D,%7B1,1,1,0,1%7D,%7B1,0,1,0,1%7D%0A        %7D)); // 6%0A        System.out.println(prob.largestSubmatrix(new int%5B%5D%5B%5D%7B%0A
             %7B1,0

Update problem 1727