LC-0084 Hard LeetCode

84. Largest Rectangle in Histogram

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 47% Topics: Array, Stack, Monotonic Stack

Reading material

Arrays & Hashing 12 min Stacks & Queues 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

class Solution(object):
    def largestRectangleArea(self, heights):
        """
        :type heights: List[int]
        :rtype: int
        """
        stk, result = [-1], 0
        for i in xrange(len(heights)+1):
            while stk[-1] != -1 and (i == len(heights) or heights[stk[-1]] >= heights[i]):
                result = max(result, heights[stk.pop()]*((i-1)-stk[-1]))
            stk.append(i) 
        return result

Solution from kamyu104/LeetCode-Solutions · MIT