Sliding window max - LC 239 | Applying my template to solve this hard problem

Описание: 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.

#leetcode239 #slidingwindow #monotonic

0:00 leetcode 239
1:27 Solved using Max Heap - nlogk
5:39 Further Optimization
11:15 Solved using Monotonic Queue - O(n)