Code RoomLargest histogram rectangle
HardPrep Room Coding #1094

Largest histogram rectangle

CodingAlgorithms & data structuresMid–Senior~30 min

Given non-negative integer bar heights of a histogram where every bar has width 1, return the area of the largest axis-aligned rectangle that fits entirely within the histogram. The list may be empty.

Implement
largest_rectangle(heights: list[int]) → int
Examples
in[[2,1,5,6,2,3]]out10
What 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
InputExpectedGot
[[2,1,5,6,2,3]]10not run yetsample