Practice Maximal Rectangle
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Maximal Rectangle on LeetCode. Use the original task for its coding environment and submissions.
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
# 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'.
Related LeetCode Problems
Practice more problems similar to Maximal Rectangle.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.