FastPrepLargest Rectangle in Histogram
Problems/Largest Rectangle in Histogram

Largest Rectangle in Histogram

Tekion logoTekion● HardFULLTIMEONSITE INTERVIEW
QuestionFunctionExamplesConstraints

Problem statement

Source note: The interview report names the canonical exercise directly. The callable interface, examples, and bounds use the standard deterministic formulation; the judged core matches the report at about 99%.

Given an integer array heights representing a histogram, where every bar has width 1, return the area of the largest rectangle that can be formed using one or more consecutive bars.

Function

largestRectangleArea(heights: int[]) → int

Examples

Example 1

heights = [2,1,5,6,2,3]return = 10

The bars of heights 5 and 6 form a rectangle of height 5 and width 2.

Example 2

heights = [2,4]return = 4

The best area is 4, achieved either by the second bar alone or by both bars at height 2.

Example 3

heights = [0]return = 0

The only bar has height 0, so no positive-area rectangle exists.

Constraints

  • 1 <= heights.length <= 100000.
  • 0 <= heights[i] <= 10000.

More Tekion problems

  • Peak Resource Usage Across Weighted IntervalsPHONE SCREEN · Seen Sep 2026
  • Next Greater Element to the RightONSITE INTERVIEW · Seen Sep 2026
  • Dungeon GamePHONE SCREEN · Seen Sep 2026
All Tekion interview questionsSee Tekion hiring insights
Saved
class Solution {
    public int largestRectangleArea(int[] heights) {
        // Write your code here.
    }
}
Checking account…