Largest rectangle in histogram
Given an array heights representing the heights of adjacent bars in a histogram where each bar has width 1, return the area of the largest rectangle that fits entirely within the histogram. Heights are non-negative integers, and 1 <= len(heights) <= 10^5.
Implement
largest_rectangle_area(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