# Leetcode 239 - Sliding window max

`Note:`

- This is a typical
`monotonic`

problem. - To always know the max of current window, we need to main a queue in
`descending order`

. - Store
`index`

instead of`value`

in the queue because we need to check if`max`

is located in window or not.

`Question:`

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 |

`Code:`

1 | /** |