# LeetCode 0239 - Sliding Window Maximum

# Sliding Window Maximum

## Desicription

Given an array 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], and k = 3 |

**Note: **

You may assume k is always valid, 1 ≤ k ≤ input array’s size for non-empty array.

**Follow up:**

Could you solve it in linear time?

## Solution

1 | class Solution { |