CodingHardcod-g046

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

Question

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