Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Sliding Window Maximum

Hard Queue

Given an array and a window size k, the window slides from the left to the right one position at a time. Print the maximum of each window.

Constraints

1 <= k <= n <= 10^5 -10^4 <= nums[i] <= 10^4

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.