Gamified challenge · Monotonic stack
heights[i] is the height of building i; every building is 1 unit wide and they stand side by side. A billboard is a rectangle resting on the ground that must stay under the rooftops: over a run of buildings from lo to hi, it can be at most as tall as the lowest of them.
Write largestRect(heights) (Python: largest_rect(heights)) that returns the largest possible billboard area. No buildings means 0.
Example: for [2, 1, 5, 6, 2, 3] the best billboard spans the buildings of heights 5 and 6 at height 5: area 10.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google