diff --git a/.idea/Competitive-Programming.iml b/.idea/Competitive-Programming.iml
index bc2cd87..4c94235 100644
--- a/.idea/Competitive-Programming.iml
+++ b/.idea/Competitive-Programming.iml
@@ -1,8 +1,2 @@
 <?xml version="1.0" encoding="UTF-8"?>
-<module type="CPP_MODULE" version="4">
-  <component name="NewModuleRootManager">
-    <content url="file://$MODULE_DIR$" />
-    <orderEntry type="inheritedJdk" />
-    <orderEntry type="sourceFolder" forTests="false" />
-  </component>
-</module>
\ No newline at end of file
+<module classpath="CIDR" type="CPP_MODULE" version="4" />
\ No newline at end of file
diff --git a/NumberTheoryandCombinatorics/ProjectEuler/SumSquareDifference/SumSquareDifference.cpp b/NumberTheoryandCombinatorics/ProjectEuler/SumSquareDifference/SumSquareDifference.cpp
index 70e76de..de81e61 100644
--- a/NumberTheoryandCombinatorics/ProjectEuler/SumSquareDifference/SumSquareDifference.cpp
+++ b/NumberTheoryandCombinatorics/ProjectEuler/SumSquareDifference/SumSquareDifference.cpp
@@ -3,28 +3,7 @@
 // Problem description Link.
 // https://www.hackerrank.com/contests/projecteuler/challenges/euler006/copy-from/1354371634
 
-#include <map>
-#include <set>
-#include <list>
-#include <cmath>
-#include <ctime>
-#include <deque>
-#include <queue>
-#include <stack>
-#include <string>
-#include <bitset>
-#include <cstdio>
-#include <limits>
-#include <vector>
-#include <climits>
-#include <cstring>
-#include <cstdlib>
-#include <fstream>
-#include <numeric>
-#include <sstream>
-#include <iostream>
-#include <algorithm>
-#include <unordered_map>
+#include <bits/stdc++.h>
 
 using namespace std;
 
@@ -50,4 +29,4 @@ int main(){
     }
 
     return 0;
-}
\ No newline at end of file
+}
diff --git a/SearchingSortingandBasicDataStructures/InbuiltSorting/Problem5/SimpleTask.cpp b/SearchingSortingandBasicDataStructures/InbuiltSorting/Problem5/SimpleTask.cpp
new file mode 100644
index 0000000..df02ee3
--- /dev/null
+++ b/SearchingSortingandBasicDataStructures/InbuiltSorting/Problem5/SimpleTask.cpp
@@ -0,0 +1,55 @@
+//
+// Created by ronal on 2/25/2023.
+//
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int Posicion(int queries, vector<tuple<int, int, int>>& VT){
+    int first, last, type, posicion;
+    int sum_diff_max = 0;
+    int sum_diff_currenty = 0;
+
+    for(int i = 0; i < queries; i++){
+        cin >> first >> last >> type;
+        if(i == 0) {
+            sum_diff_max = last - first;
+            posicion = i;
+        }else{
+            sum_diff_currenty = last - first;
+            if(sum_diff_max < sum_diff_currenty){
+                sum_diff_max = sum_diff_currenty;
+                sum_diff_currenty = 0;
+                posicion = i;
+            }
+        }
+        VT.emplace_back(first, last, type);
+    }
+    return posicion;
+}
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    string S;
+    int size, queries;
+    vector<tuple<int, int, int>> VT;
+    cin >> size >> queries;
+    cin.ignore();
+    getline(cin, S);
+
+    int p = Posicion(queries, VT);
+    for(int i = p; i < VT.size(); i++) {
+        if ( get<2>(VT[i]) == 1) {
+            sort(S.begin() + get<0>(VT[i]) - 1, S.begin() + get<1>(VT[i]));
+        } else if (get<2>(VT[i]) == 0) {
+            sort(S.begin() + get<0>(VT[i]) - 1, S.begin() + get<1>(VT[i]), greater<>());
+        }
+    }
+//    for(const auto & i : S){
+//        cout << i;
+//    }
+        cout << S;
+    return 0;
+}
+
+
diff --git a/SearchingSortingandBasicDataStructures/Set/Problem1/Sets.cpp b/SearchingSortingandBasicDataStructures/Set/Problem1/Sets.cpp
new file mode 100644
index 0000000..bbc2778
--- /dev/null
+++ b/SearchingSortingandBasicDataStructures/Set/Problem1/Sets.cpp
@@ -0,0 +1,33 @@
+//
+// Created by ronal on 2/25/2023.
+// Problem Description Link.
+// https://www.hackerrank.com/challenges/cpp-sets/problem
+
+#include <bits/stdc++.h>
+using namespace std;
+
+
+int main() {
+    int Q, y, x;
+    set<int> S;
+    cin >> Q;
+    for(int i = 0; i < Q; i++){
+        cin >> y >> x;
+        if(y == 1){
+            S.insert(x);
+        }else if(y == 2){
+            S.erase(x);
+        }else if(y == 3){
+            auto it = S.find(x);
+            if(it != S.end()){
+                cout << "Yes\n";
+            }else{
+                cout << "No\n";
+            }
+        }
+    }
+    return 0;
+}
+
+
+