✨ Day 28; Week 4 ✔️

Author: Akash Rajpurohit

README.md

@@ -38,6 +38,7 @@
 4. [Smallest Integer Divisible by K](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/567/week-4-november-22nd-november-28th/3543/) ➡️ [CPP Solution](Week4/smallestRepunitDivByK.cpp)
 5. [Longest Substring with At Least K Repeating Characters](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/567/week-4-november-22nd-november-28th/3544/) ➡️ [CPP Solution](Week4/longestSubstring.cpp)
 6. [Partition Equal Subset Sum](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/567/week-4-november-22nd-november-28th/3544/) ➡️ [CPP Solution](Week4/canPartition.cpp)
+7. [Sliding Window Maximum](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/567/week-4-november-22nd-november-28th/3544/) ➡️ [CPP Solution](Week4/maxSlidingWindow.cpp)
 
 ## Week 5 🚧
 Coming soon...

Week4/maxSlidingWindow.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
+        vector<int> res;
+        multiset<int> s;
+        
+        for(int i = 0; i < k; ++i) {
+            s.insert(nums[i]);
+        }
+        
+        res.push_back(*(s.rbegin()));
+        
+        for(int i = k; i < nums.size(); ++i) {
+            s.erase(s.find(nums[i - k]));
+            s.insert(nums[i]);
+            res.push_back(*(s.rbegin()));
+        }
+        
+        return res;
+    }
+};