LC-3113 Hard LeetCode

3113. Find the Number of Subarrays Where Boundary Elements Are Maximum

Array Binary Search Stack Monotonic Stack

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 31% Topics: Array, Binary Search, Stack, Monotonic Stack

Reading material

Arrays & Hashing 12 min Binary Search 12 min Stacks & Queues 11 min

Reference solution (spoiler · python)

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

# mono stack, combinatorics
class Solution(object):
    def numberOfSubarrays(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = 0
        stk = []
        for x in nums:
            while stk and stk[-1][0] < x:
                stk.pop()
            if not stk or stk[-1][0] != x:
                stk.append([x, 0])
            stk[-1][1] += 1
            result += stk[-1][1]
        return result

Solution from kamyu104/LeetCode-Solutions · MIT