LC-0239 Hard LeetCode

239. Sliding Window Maximum

Array Queue Sliding Window Heap (Priority Queue) Monotonic Queue

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 47% Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue

Reading material

Arrays & Hashing 12 min Stacks & Queues 11 min Sliding Window 11 min

Reference solution (spoiler · python)

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

from collections import deque


class Solution(object):
    def maxSlidingWindow(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        result, dq = [], deque()
        for i in xrange(len(nums)):
            if dq and i-dq[0] == k:
                dq.popleft()
            while dq and nums[dq[-1]] <= nums[i]:
                dq.pop()
            dq.append(i)
            if i >= k-1:
                result.append(nums[dq[0]])
        return result

Solution from kamyu104/LeetCode-Solutions · MIT