add new implementations for ordered map, k-sorted array sorting, and string removal; delete unused files

Author: Adityasinghvats

09_String/01removepart.cpp

@@ -0,0 +1,38 @@
+#include<bits/stdc++.h>
+using namespace std;
+class Solution {
+    public:
+        string removeOccurrences(string s, string part) {
+            //sliding window of size same as part
+            int n = part.size();
+            string win = "";
+            int idx = 0;
+            while(idx<s.size()){
+                if(win.size()<=n){
+                    win.append(s.substr(idx,n));
+                }
+                cout<<win<<endl;
+                if(win==part){
+                    win = "";
+                    s.erase(idx,n);
+                    cout<<s<<endl;
+                    idx=0;
+                }
+                else{
+                    win = "";
+                    idx++;
+                }
+            }
+            return s;
+        }
+    };
+int main(){
+    string s = "ccctltctlltlb";
+    string part = "ctl";
+    Solution *sol1 = new Solution();
+    string ans = sol1->removeOccurrences(s,part);
+    cout<<ans;
+}
+/*
+LC1910. Remove All Occurrences of a Substring
+*/

26Heap/03Ksamllest.cpp renamed to 26Heap/03Ksmallest.cpp

@@ -0,0 +1,49 @@
+#include<iostream>
+#include<queue>
+using namespace std;
+
+//sort a k sorted array (mostly sorted array)
+
+// void ksorted(vector<int>& v, int k, vector<int> &ans){
+//     //O(nlogk)
+//     priority_queue<int, vector<int>, greater<int>> pq;//min heap
+//     for(int i=0;i<v.size();i++){
+//         pq.push(v[i]);
+//         if(pq.size()>k) {
+//             ans.push_back(pq.top());
+//             pq.pop();
+//         }
+//     }
+//     while(!pq.empty()){
+//         ans.push_back(pq.top());
+//         pq.pop();
+//     }
+//     return;
+// }
+
+//without extra space
+void ksorted(vector<int>& v, int k){
+    //O(nlogk)
+    priority_queue<int, vector<int>, greater<int>> pq;//min heap
+    int idx = 0;
+    for(int i=0;i<v.size();i++){
+        pq.push(v[i]);
+        if(pq.size()>k) {
+            v[idx++] = pq.top();
+            pq.pop();
+        }
+    }
+    while(!pq.empty()){
+        v[idx++] = pq.top();
+        pq.pop();
+    }
+    return;
+}
+int main(){
+    vector<int> v = {6,5,3,2,8,10,9};
+    int k = 3;
+    ksorted(v,k); 
+    for(int ele:v){
+        cout<<ele<<" ";
+    }
+}

26Heap/03Ksamllest.exe renamed to 26Heap/03Ksmallest.exe

@@ -1,5 +1,6 @@
 #include<iostream>
 #include<unordered_set>
+#include<set>
 using namespace std;
 int main(){
     unordered_set<int> us;
@@ -17,7 +18,17 @@ int main(){
          */
         cout<<"exists"<<endl;
     }
-    for(int ele : us){//prints in random order and only unique elements
+    // for(int ele : us){//prints in random order and only unique elements
+    //     cout<<ele<<" ";
+    // }
+    
+    set<int> st;
+    st.insert(10);
+    st.insert(20);
+    st.insert(23);
+    st.insert(32);
+    st.insert(32);
+    for(int ele : st){
         cout<<ele<<" ";
     }
 }

26Heap/04sortKSorted.cpp

@@ -0,0 +1,28 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    //ordered set arranges on basis of key
+    map<int,string> mp;
+    map<string,int> mp2;
+    mp.emplace(1,"a");
+    mp.emplace(2,"we");
+    mp.emplace(3,"abd");
+    mp.emplace(4,"z");
+    mp.emplace(5,"m");
+
+    mp2.emplace("a",1);
+    mp2.emplace("we",2);
+    mp2.emplace("abd",5);
+    mp2.emplace("z",0);
+    mp2.emplace("m",9);
+
+
+    for(auto ele: mp){
+        cout<<ele.first<<":"<<ele.second<<endl;
+    }
+    cout<<endl;
+    for(auto ele: mp2){
+        cout<<ele.first<<":"<<ele.second<<endl;
+    }
+
+}

26Heap/04sortKSorted.exe

@@ -0,0 +1,2 @@
+/*
+Simple file for doing a local run for lC questions*/