- We need the MAX in the sliding window, and the max item will not fluctuate between max and not max, for example if it's max it will not become not max and again become max. So this hints at not using priority queue.
- Store the indexes of elements in the sliding window in dequeue, dequeue because we need to check if new element is more than the last element of the queue. Also, we need to check if first element of dequeue is less than
i-k+1.