Largest One Submatrix with Column Swaps - Google Top Interview Questions


Problem Statement :


You are given a two-dimensional list of integers matrix containing 1s and 0s. 

Given that you can first rearrange the columns as many times as you want, return the area of the largest submatrix containing all 1s.

Constraints

1 ≤ n * m ≤ 100,000 where n and m are the number of rows and columns in matrix

Example 1

Input

matrix = [

    [0, 0, 1],

    [1, 1, 1],

    [1, 0, 1]

]

Output

4

Explanation

We can rearrange the columns to:



[[0, 1, 0],

 [1, 1, 1],

 [1, 1, 0]]

And then take the bottom 2 x 2 submatrix with all 1s


Solution :



title-img 




                        Solution in C++ :

int solve(vector<vector<int>>& mat) {
    int n = mat.size(), m = mat[0].size(), ret = 0;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (mat[i][j]) mat[i][j] += mat[i - 1][j];
        }
    }
    for (auto& row : mat) sort(row.begin(), row.end());
    for (int i = 0; i < n; i++) {
        for (int j = m - 1; j >= 0; j--) {
            ret = max(ret, mat[i][j] * (m - j));
        }
    }
    return ret;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[][] matrix) {
        int m = matrix.length;
        int n = matrix[0].length;

        int[] heights = new int[n];
        int res = 0;

        for (int row = 0; row < m; row++) {
            for (int col = 0; col < n; col++) {
                if (matrix[row][col] == 1) {
                    heights[col]++;
                } else {
                    heights[col] = 0;
                }
            }

            int[] cur_heights = heights.clone();
            Arrays.sort(cur_heights);

            for (int col = 0; col < n; col++) {
                res = Math.max(res, cur_heights[col] * (n - col));
            }
        }
        return res;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, matrix):
        rows, cols = len(matrix), len(matrix[0])

        # compute histogram
        hist = [[0 for col in range(cols)] for row in range(rows)]
        for col in range(cols):
            hist[0][col] = matrix[0][col]
            for row in range(1, rows):
                if matrix[row][col]:
                    hist[row][col] = hist[row - 1][col] + 1
                else:
                    hist[row][col] = 0

        # counting sort of rows
        for row in range(rows):
            count = [0 for val in range(rows + 1)]
            for col in range(cols):
                count[hist[row][col]] += 1
            col = 0
            for val in range(rows, -1, -1):
                for _ in range(count[val]):
                    hist[row][col] = val
                    col += 1

        # find max rectangle
        max_area = 0
        for row in range(rows):
            for col in range(cols):
                max_area = max(max_area, (col + 1) * hist[row][col])
        return max_area


View More Similar Problems

Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →

Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →