Questions and notes:

Question 1

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.

Answer 1

Edge cases:
1]When there is only 1 element
2]When deque size exceeds window size
3]When deque.front() falls outside window
4]1st k-1 additions into the deque need to be done without pushing to the answer vector since sliding window is still reaching required size