Maximal rectangle
Given a 2D binary matrix filled with 0s and 1s, return the area of the largest rectangle containing only 1s. The matrix has up to 200 rows and 200 columns. Return 0 if there are no 1s.
Implement
maximal_rectangle(matrix: list[list[int]]) → intExamples
in
[[[1,0,1,0,0],[1,0,1,1,1],[1,1,1,1,1],[1,0,0,1,0]]]out6What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[[1,0,1,0,0],[1,0,1,1,1],[1,1,1,1,1],[1,0,0,1,0]]]6not run yetsample