Count Rectangular Submatrices - Google Top Interview Questions


Problem Statement :


Given a two-dimensional list of integers matrix containing 1s and 0s, return the total number of submatrices with all 1 s.

Constraints

n, m ≤ 250 where n and m are the number of rows and columns in matrix.

Example 1

Input

matrix = [

    [1, 1, 0],

    [1, 1, 0],

    [0, 0, 0]

]

Output
9

Explanation

There's four 1 x 1 matrices. Theres two 2 x 1 matrices. There's two 1 x 2 matrices. And there's one 2 x 2 
matrix.



Solution :



title-img




                        Solution in C++ :

int solve(vector<vector<int>>& matrix) {
    int n = matrix.size(), m = matrix[0].size();
    vector<vector<int>> dp(n + 1, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (!matrix[i][j]) continue;
            dp[i][j] = j == 0 ? 1 : dp[i][j - 1] + 1;
        }
    }
    int ans = 0;
    for (int j = 0; j < m; ++j) {
        stack<pair<int, int>> st;
        for (int i = 0; i <= n; ++i) {
            int v = dp[i][j], len = 1;
            while (!st.empty() && st.top().first > v) {
                auto [h, w] = st.top();
                st.pop();
                int lo = v;
                if (!st.empty() && st.top().first >= v) {
                    lo = st.top().first;
                    st.top().second += w;
                } else
                    len += w;
                ans += (h - lo) * w * (w + 1) / 2;
            }
            if (!st.empty() && st.top().first == v)
                st.top().second++;
            else
                st.emplace(v, len);
            cout << ans << " ";
        }
    }
    return ans;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[][] a) {
        if (a == null || a.length == 0 || a[0].length == 0) {
            return 0;
        }

        int n = a.length;
        int m = a[0].length;

        int ans = 0;

        int[] row = new int[m];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[i][j] == 0) {
                    row[j] = 0;
                } else {
                    row[j]++;
                }
            }
            int[] dp = new int[m];
            //  [1, 2, 3, 7, 4*]

            Stack<Integer> stack = new Stack<>();

            for (int j = 0; j < m; j++) {
                while (stack.size() > 0 && row[stack.peek()] >= row[j]) {
                    stack.pop();
                }
                dp[j] = (stack.size() > 0 ? (j - stack.peek()) * row[j] + dp[stack.peek()]
                                          : row[j] * (j + 1));
                ans += dp[j];
                stack.push(j);
            }
        }
        return ans;
    }
}
                    




View More Similar Problems

2D Array-DS

Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t

View Solution →

Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →

Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →

Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →

Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →

Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →