<p>You are given an array of integers&nbsp;<code>nums</code>, there is a sliding window of size <code>k</code> which is moving from the very left of the array to the very right. You can only see the <code>k</code> numbers in the window. Each time the sliding window moves right by one position.</p>

<p>Return <em>the max sliding window</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,-1,-3,5,3,6,7], k = 3
<strong>Output:</strong> [3,3,5,5,6,7]
<strong>Explanation:</strong> 
Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       <strong>3</strong>
 1 [3  -1  -3] 5  3  6  7       <strong>3</strong>
 1  3 [-1  -3  5] 3  6  7      <strong> 5</strong>
 1  3  -1 [-3  5  3] 6  7       <strong>5</strong>
 1  3  -1  -3 [5  3  6] 7       <strong>6</strong>
 1  3  -1  -3  5 [3  6  7]      <strong>7</strong>
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1], k = 1
<strong>Output:</strong> [1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>

class Solution:
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
        deque = [0] * 100001
        head = tail = 0
        l = 0
        r = k-1
        ansNum = len(nums) - k + 1
        ans = [0] * ansNum
        
        for i in range(k-1):
            while head < tail and nums[deque[tail-1]] <= nums[i]:
                tail -= 1
            deque[tail] = i
            tail += 1
       
        for l in range(ansNum):
            while head < tail and nums[deque[tail-1]] <= nums[r]:
                tail -= 1
            deque[tail] = r
            tail += 1
            ans[l] = nums[deque[head]]
            if deque[head] == l:
                head += 1
            r += 1
        return ans

        # deq = deque()  # Initialize a deque
        # ans = []       # List to store results

        # for i in range(len(nums)):
        #     # Remove elements not in the sliding window
        #     if deq and deq[0] < i - k + 1:
        #         deq.popleft()
            
        #     # Remove elements smaller than the current element
        #     # from the deque
        #     while deq and nums[deq[-1]] <= nums[i]:
        #         deq.pop()
            
        #     # Add the current element's index to the deque
        #     deq.append(i)
            
        #     # Append the maximum element in the current sliding window to ans
        #     if i >= k - 1:
        #         ans.append(nums[deq[0]])
        
        # return ans

    
33401