Sliding Window Maximum — Hard Coding Interview Question

You are given an array of integers nums and a sliding window of size k moving from the left of the array to the right, one position at a time. Return the max sliding window — an array of the maximum value in each window position.

Example

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

Output: [3,3,5,5,6,7]

Constraints

• 1 ≤ nums.length ≤ 10⁵
• -10⁴ ≤ nums[i] ≤ 10⁴
• 1 ≤ k ≤ nums.length

Topics & Companies

Topics: arrays, sliding-window, heap

Asked by: Amazon, Google, Meta, Microsoft, Bloomberg

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(k).

Practice more

• All DSA Problems
• DSA Patterns