CodingHardcod-g757

Subject Monotonic stackLevel Mid–Senior~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.