Skip to main content

Sliding Window Maximum

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

Problems50 / 152
Sign in

Sliding Window Maximum

HARDArraySliding Window

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

Example 1

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

Example 2

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

Use a deque (double-ended queue) to store indices. Remove indices outside window from front, remove indices with smaller values from back, add current index to back.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
nums =
[1,3,-1,-3,5,3,6,7]
k =
3
Expected
[3,3,5,5,6,7]
Run with your own input (JSON)