Given an array of integers nums and an integer $k,$ where $k$ is less than or equal to the length of the array, your task is to find the maximum element in each sliding window of size $k$ as it moves from left to right through the array. The sliding window moves one position at a time.

Example:

Input: nums $=[1,3,-1,-3,5,3,6,7],k=3$

Output: $3,3,5,5,6,7$

Explanation:

Window position $1$:$[1,3,-1],$ max $=3$

Window position $2$:$[3,-1,-3],$ max $=3$

Window position $3$:$[-1,-3,5],$ max $=5$

Window position $4$: $[-3,5,3],$max$=5$

Window position $5$:$[5,3,6],$ max $=6$

Window position $6$:$[3,6,7],$ max $=7$

$[]$ from collections import deque

def maxSlidingWindow$($nums$,$ k$)$:

#TODO: implement this function

# Example Usage

nums $=[1,3,-1,-3,5,3,6,7]$

$k=3$