Maximal Rectangle Problem

Maximal Rectangle Problem — ExecCode Hard DSA Practice

Solve the Maximal Rectangle problem on ExecCode. Free online hard DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Examples Example 1 Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]] Output: 6 Explanation: The maximal rectangle is shown in the above picture. Example 2 Input: matrix = [["0"]] Output: 0 Example 3 Input: matrix = [["1"]] Output: 1 Constraints rows == matrix.length cols == matrix[i].length 1 <= rows, cols <= 200 matrix[i][j] is '0' or '1'.

Examples

Input {"matrix": [["1", "0", "1", "0", "0"], ["1", "0", "1", "1", "1"], ["1", "1", "1", "1", "1"], ["1", "0", "0", "1", "0"]]}; Output 6. Input {"matrix": [["0"]]}; Output 0. Input {"matrix": [["1"]]}; Output 1

Constraints

rows == matrix.length cols == matrix[i].length 1 <= rows, cols <= 200 matrix[i][j] is '0' or '1'.

Practice Maximal Rectangle free on ExecCode. Browse DSA problems, topic map, and placement guides.