Merge pull request matthewsamuel95#144 from shivansh/single_number_variant

[Bit manipulation] Single element in array where every other element appears thrice

Author: matthewsamuel95

BitManipulation/single_number/singleNumberTriplet.cpp

@@ -0,0 +1,22 @@
+// Given an array of integers, every element appears thrice except one. Find that single one.
+
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int singleNumber(vector<int>& nums) {
+    int ones = 0, twos = 0;
+
+    for (int i = 0; i < nums.size(); i++) {
+        ones = (ones ^ nums[i]) & ~twos;
+        twos = (twos ^ nums[i]) & ~ones;
+    }
+
+    return ones;
+}
+
+int main() {
+    vector<int> nums = {3, 4, 2, 3, 3, 4, 4};
+    cout << singleNumber(nums) << endl;
+    return 0;
+}