Sitelet https://rulcode.com/problem/sliding-window-maximum

Fetching algorithms...

Sliding Window Maximum Visualizer & Solution | Rulcode

rulcode

52. Sliding Window Maximum

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

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)

Loading problem details...

rulcode

52. Sliding Window Maximum

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

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]

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

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

52. Sliding Window Maximum

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Companies

Hint

Use Cases