Lonely Integer Problem of Hackerrank

C++ Solution of Lonely Problem of Hackerrank

Author: pratyushp21

Hackerrank/Problem Solving/LoneyInteger.cpp

@@ -0,0 +1,78 @@
+//problem :-https://www.hackerrank.com/challenges/lonely-integer/problem
+//Platfrom :- Hackerrank
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+vector<string> split_string(string);
+//Here is the main code
+int lonelyinteger(vector<int> a) {
+  int ans=0;
+  //taking xor of all numbers
+  //xor of same number will become Zero
+  for(int i=0;i<a.size();i++)
+  {
+      ans^=a[i];
+  }
+return ans;
+}
+
+int main()
+{
+    ofstream fout(getenv("OUTPUT_PATH"));
+
+    int n;
+    cin >> n;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    string a_temp_temp;
+    getline(cin, a_temp_temp);
+
+    vector<string> a_temp = split_string(a_temp_temp);
+
+    vector<int> a(n);
+
+    for (int i = 0; i < n; i++) {
+        int a_item = stoi(a_temp[i]);
+
+        a[i] = a_item;
+    }
+
+    int result = lonelyinteger(a);
+
+    fout << result << "\n";
+
+    fout.close();
+
+    return 0;
+}
+
+vector<string> split_string(string input_string) {
+    string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
+        return x == y and x == ' ';
+    });
+
+    input_string.erase(new_end, input_string.end());
+
+    while (input_string[input_string.length() - 1] == ' ') {
+        input_string.pop_back();
+    }
+
+    vector<string> splits;
+    char delimiter = ' ';
+
+    size_t i = 0;
+    size_t pos = input_string.find(delimiter);
+
+    while (pos != string::npos) {
+        splits.push_back(input_string.substr(i, pos - i));
+
+        i = pos + 1;
+        pos = input_string.find(delimiter, i);
+    }
+
+    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
+
+    return splits;
+}