<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]:
        i = 0
        heap = []
        res = []
        m = {}

        while i < k:
            heapq.heappush(heap, -1 * nums[i])
            i += 1

        res.append(heap[0] * -1)

        while i < len(nums):
            removeIdx = i - k
            removeVal = nums[removeIdx]
            nextVal = nums[i]

            if removeVal == heap[0]*-1:
                heapq.heappop(heap)

                while heap and (heap[0]*-1) in m and m[(heap[0]*-1)] > 0:
                    popped = heapq.heappop(heap) * -1
                    m[popped] -= 1

                heapq.heappush(heap, nextVal * -1)
                res.append(heap[0] * -1)
            else:
                if removeVal in m:
                    m[removeVal] += 1
                else:
                    m[removeVal] = 1
                heapq.heappush(heap, nextVal * -1)
                res.append(heap[0] * -1)

            i += 1

        return res

39326