BackhardSliding Window

Array Window Maxima Solution

Problem Statement

Given an array of integers and a window size, find the maximum value in each window as it slides through the array.

Example 1
Input
[4, 2, 9, 7, 5, 3, 1] and window size 3
Output
[]

Explanation: For window size 3, the maximum in each window is calculated as the window slides through the array: Window 1: [4, 2, 9], max = 9; Window 2: [2, 9, 7], max = 9; Window 3: [9, 7, 5], max = 9; Window 4: [7, 5, 3], max = 7; Window 5: [5, 3, 1], max = 5.

Example 2
Input
[1, 3, 5, 2, 6, 4] and window size 2
Output
[]

Explanation: For window size 2, the maximum in each window is: Window 1: [1, 3], max = 3; Window 2: [3, 5], max = 5; Window 3: [5, 2], max = 5; Window 4: [2, 6], max = 6; Window 5: [6, 4], max = 6.

Constraints

  • Array length is between 1 and 10^5
  • Window size is between 1 and the length of the array
  • All elements in the array are integers

More Sliding Window Problems

Maximum Average SubsequenceeasyMax Average SubarrayeasyMinimized Capacity WindoweasyMinimized Range Extenteasy
View all problems →
Live Compiler
Loading...
Test Cases & Output
🔒 Sign up to run your code

🚀 Practice this problem

Run code, get AI hints & track streak

Sign Up Free