cpp-flashcards/org/study_deck_02/dsa/sliding-window/0239-sliding-window-maximum.org

• 0239. Sliding Window Maximum
  • Approach
  • Python
  • C++

TODO 0239. Sliding Window Maximum   hard

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 = [1], k = 1
Output: [1]

Constraints:

• 1 <= nums.length <= 10^{5}
• -10^{4} <= nums[i] <= 10^{4}
• 1 <= k <= nums.length

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:

TODO C++

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        
    }
};