Sliding Window maximum

1492/solution.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int kthFactor(int n, int k) {
+        int i,j=0;
+        for(i=1;i<=n;i++){
+
+            if(n%i==0)
+               {
+                   j++;
+                   if(j==k)
+                    return i;
+               }
+
+        }
+        return -1;
+    }
+};

239-Sliding-window-maximum/239-Sliding-Windowm-maximum.cpp

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

384-Shuffle-an Array/Shuffle-an-Arraay.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+vector<int>a,t;
+    Solution(vector<int>& nums) {
+      a=nums;
+      t=nums;
+    }
+
+    vector<int> reset() {
+        return t;
+    }
+
+    vector<int> shuffle() {
+        prev_permutation(a.begin(),a.end());
+        return a;
+    }
+};
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * Solution* obj = new Solution(nums);
+ * vector<int> param_1 = obj->reset();
+ * vector<int> param_2 = obj->shuffle();
+ */