Sliding window maximum
Hardsliding windowdequemonotonic queue
A window of size k slides across nums one step at a time. Return the maximum of each window position, in O(n).
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]
Constraints
- 1 ≤ k ≤ nums.length ≤ 10⁵
Submit checks your solution against 7 tests, including hidden ones.
/**
* @param {int[]} nums
* @param {int} k
* @return {int[]}
*/
function maxSlidingWindow(nums, k) {
}