NeetCode #378LC-84HardStackNC 150NC 250
← Back to All Problems#378 · #84 · Largest Rectangle in Histogram(柱状图中最大的矩形)
📌 Problem Statement & Constraints
Given an array
heights representing the heights of bars of width 1 in a histogram, return the area of the largest rectangle that fits inside the histogram. Constraints: 1 <= heights.length <= 10^5, 0 <= heights[i] <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!