Add code for HackerRank problem solving #17

Hackerrank/Array_manipulation.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+   int n,m;
+   cin>>n>>m;
+   vector<vector<int>> queries( m , vector<int> (3)); 
+    for(int i = 0; i < m; i++){
+        for(int j = 0; j < 3; j++){
+            cin>>queries[i][j];
+        }
+    }
+    vector<long long> arr(n,0);
+    for(int i=0;i<m;i++){
+            int a=queries[i][0];
+            int b=queries[i][1];
+            long long k=queries[i][2];
+            arr[a-1]+=k;
+            arr[b]-=k;
+        }
+    for(int i=1;i<n;i++){
+        arr[i]+=arr[i-1];
+    }
+    cout<<*max_element(arr.begin(),arr.end())<<"\n";
+
+    return 0;
+}

Hackerrank/Sparse_array.cpp

@@ -0,0 +1,69 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+// Complete the matchingStrings function below.
+vector<int> matchingStrings(vector<string> strings, vector<string> queries) {
+    sort(strings.begin(),strings.end());
+    vector<int>ans(queries.size());
+    for(int i=0;i<queries.size();i++){
+        int count=0;
+        int j=0;
+        while(j<strings.size()){
+            if(queries[i]==strings[j])
+                count++;
+            else if(count)
+                break;
+            j++;
+        }
+        ans[i]=count; 
+    }
+    return ans;
+}
+
+int main()
+{
+    ofstream fout(getenv("OUTPUT_PATH"));
+
+    int strings_count;
+    cin >> strings_count;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    vector<string> strings(strings_count);
+
+    for (int i = 0; i < strings_count; i++) {
+        string strings_item;
+        getline(cin, strings_item);
+
+        strings[i] = strings_item;
+    }
+
+    int queries_count;
+    cin >> queries_count;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    vector<string> queries(queries_count);
+
+    for (int i = 0; i < queries_count; i++) {
+        string queries_item;
+        getline(cin, queries_item);
+
+        queries[i] = queries_item;
+    }
+
+    vector<int> res = matchingStrings(strings, queries);
+
+    for (int i = 0; i < res.size(); i++) {
+        fout << res[i];
+
+        if (i != res.size() - 1) {
+            fout << "\n";
+        }
+    }
+
+    fout << "\n";
+
+    fout.close();
+
+    return 0;
+}

Hackerrank/lonely_integer.cpp

@@ -0,0 +1,17 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+bool flag=false;
+int main(){
+ios_base::sync_with_stdio(false);
+cin.tie(0);
+cout.tie(0);
+int n,temp,res=0;
+cin>>n;
+for(int i=0;i<n;i++){
+    cin>>temp;
+    res=res^temp;
+}
+cout<<res<<"\n";
+return 0;
+}

Hackerrank/maximizing_xor.cpp

@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+bool flag=false;
+int main(){
+ios_base::sync_with_stdio(false);
+cin.tie(0);
+cout.tie(0);
+int l,r,max_xor=0;
+cin>>l>>r;
+for(int i=l;i<r;i++){
+    for(int j=i+1;j<=r;j++){
+        if((i^j)>max_xor)
+            max_xor=i^j;
+    }
+}
+cout<<max_xor<<"\n";
+return 0;
+}