# [Solved] 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.

## 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
Output: [3,3,5,5,6,7]
Explanation:
Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       3
1 [3  -1  -3] 5  3  6  7       3
1  3 [-1  -3  5] 3  6  7       5
1  3  -1 [-3  5  3] 6  7       5
1  3  -1  -3 [5  3  6] 7       6
1  3  -1  -3  5 [3  6  7]      7
```

Example 2:

```Input: nums = , k = 1
Output: 
```

Constraints:

• `1 <= nums.length <= 105`
• `-104 <= nums[i] <= 104`
• `1 <= k <= nums.length`

## Python Solution

```class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
out = []
out.append(max(nums[:k]))

for i in range(len(nums)-k):
new = nums[i+k]
old = nums[i]

if new>out[-1]:
out.append(new)
else:
if out[-1]==old:
out.append(max(nums[i+1:k+i+1]))
else:
out.append(out[-1])
return(out)``` ##### Abhishek Sharma

Started my Data Science journey in my 2nd year of college and since then continuously into it because of the magical powers of ML and continuously doing projects in almost every domain of AI like ML, DL, CV, NLP.

Articles: 521