Sliding Window Maximum Python Solution

lcpy gen -n 239   # by problem number
lcpy gen -s sliding_window_maximum   # by problem name

Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
Output: [3,3,5,5,6,7]

Input: nums = [1], k = 1
Output: [1]

from collections import deque


class Solution:
    # Time: O(n)
    # Space: O(k)
    def max_sliding_window(self, nums: list[int], k: int) -> list[int]:
        result: list[int] = []
        # Store indices of elements in decreasing order of values
        dq: deque[int] = deque()

        for i, num in enumerate(nums):
            # Remove indices that are out of the current window
            while dq and dq[0] <= i - k:
                dq.popleft()

            # Remove indices whose corresponding values are less than the current value
            while dq and nums[dq[-1]] < num:
                dq.pop()

            # Add current index
            dq.append(i)

            # Add maximum to result when we have a complete window
            if i >= k - 1:
                result.append(nums[dq[0]])

        return result