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.
30:00
Java
Sliding Window Maximum
hard
Topics
Companies
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]
Constraints:
1≤nums.length≤105
−104≤nums[i]≤104
1≤k≤nums.length
Input
arr ={"nums":[1,3,-1,-3,5,3,6,7],"k":3}
nums (k = 3)
Window:
[0...0]
Monotonic Deque (indices → values):
front →
empty
← back
Algorithm Insight:
Maintain a monotonic decreasing deque of indices. Front always holds the max. Remove from front if outside window. Remove from back if smaller than current.