Problem
Ask
Submissions

Problem: Largest Rectangle in Histogram

Hard
40 min
Understand how to solve the largest rectangle in histogram problem by implementing an optimal algorithm that runs in linear time and uses stack-based techniques. This lesson helps you apply data structures for efficient area calculation within given constraints.

Statement

Given an array of integers, heights, that represents the heights of bars in a histogram, find the area of the largest rectangle in the histogram, where the rectangle has a constant width of 11 unit for each bar.

Constraints

  • 11 \leq heights.length 103\leq 10^3
  • 00 \leq heights[i] 104\leq 10^4
Problem
Ask
Submissions

Problem: Largest Rectangle in Histogram

Hard
40 min
Understand how to solve the largest rectangle in histogram problem by implementing an optimal algorithm that runs in linear time and uses stack-based techniques. This lesson helps you apply data structures for efficient area calculation within given constraints.

Statement

Given an array of integers, heights, that represents the heights of bars in a histogram, find the area of the largest rectangle in the histogram, where the rectangle has a constant width of 11 unit for each bar.

Constraints

  • 11 \leq heights.length 103\leq 10^3
  • 00 \leq heights[i] 104\leq 10^4