Largest histogram rectangle
Given the heights of bars in a histogram (each bar has width 1), find the area of the largest axis-aligned rectangle that fits entirely within the histogram. Return that maximum area. Constraints: 0 <= n <= 10^5, 0 <= height[i] <= 10^4.
Implement
largest_rectangle(heights: list[int]) → intExamples
in
[[2,1,5,6,2,3]]out10What 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
[[2,1,5,6,2,3]]10not run yetsample