52. Sliding Window Maximum

Hard

Topics

Example 1:

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

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

Explanation: The maximum values for each window of size 3 are [3, 3, 5, 5, 6, 7]. Window positions PO | Max --------------------|----- [1 3 -1] -3 5 3 6 7 | 3 1 [3 -1 -3] 5 3 6 7 | 3 1 3 [-1 -3 5] 3 6 7 | 5 1 3 -1 [-3 5 3] 6 7 | 5 1 3 -1 -3 [5 3 6] 7 | 6 1 3 -1 -3 5 [3 6 7] | 7

Example 2:

Input: nums = [1], k = 1

Output: [1]

Explanation: The maximum value for the single window of size 1 is [1].

Example 3:

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

Output: [1, -1]

Explanation: The maximum values for the windows of size 1 are [1, -1].

Example 4:

Input: nums = [9,11], k = 2

Output: [11]

Explanation: The maximum value for the window of size 2 is [11].

Example 5:

Input: nums = [4,-2], k = 2

Output: [4]

Explanation: The maximum value for the window of size 2 is [4].

Constraints:

•
•
•

Time Complexity

O(n)

Space Complexity

O(k)

52. Sliding Window Maximum

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Algorithm Overview

Topics

52. Sliding Window Maximum

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Algorithm Overview

Topics