New Problem Solution - "1835. Find XOR Sum of All Pairs Bitwise AND"

haoel · haoel · commit fb3a12e4b54c · 2021-04-20T18:25:25.000+08:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ LeetCode
 
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1835|[Find XOR Sum of All Pairs Bitwise AND](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/) | [C++](./algorithms/cpp/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.cpp)|Hard|
 |1834|[Single-Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/) | [C++](./algorithms/cpp/singleThreadedCpu/SingleThreadedCpu.cpp)|Medium|
 |1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/) | [C++](./algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp)|Medium|
 |1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | [C++](./algorithms/cpp/checkIfTheSentenceIsPangram/CheckIfTheSentenceIsPangram.cpp)|Easy|
diff --git a/algorithms/cpp/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.cpp b/algorithms/cpp/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.cpp
@@ -0,0 +1,52 @@
+// Source : https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/
+// Author : Hao Chen
+// Date   : 2021-04-20
+
+/***************************************************************************************************** 
+ *
+ * The XOR sum of a list is the bitwise XOR of all its elements. If the list only contains one 
+ * element, then its XOR sum will be equal to this element.
+ * 
+ * 	For example, the XOR sum of [1,2,3,4] is equal to 1 XOR 2 XOR 3 XOR 4 = 4, and the XOR sum 
+ * of [3] is equal to 3.
+ * 
+ * You are given two 0-indexed arrays arr1 and arr2 that consist only of non-negative integers.
+ * 
+ * Consider the list containing the result of arr1[i] AND arr2[j] (bitwise AND) for every (i, j) pair 
+ * where 0 <= i < arr1.length and 0 <= j < arr2.length.
+ * 
+ * Return the XOR sum of the aforementioned list.
+ * 
+ * Example 1:
+ * 
+ * Input: arr1 = [1,2,3], arr2 = [6,5]
+ * Output: 0
+ * Explanation: The list = [1 AND 6, 1 AND 5, 2 AND 6, 2 AND 5, 3 AND 6, 3 AND 5] = [0,1,2,0,2,1].
+ * The XOR sum = 0 XOR 1 XOR 2 XOR 0 XOR 2 XOR 1 = 0.
+ * 
+ * Example 2:
+ * 
+ * Input: arr1 = [12], arr2 = [4]
+ * Output: 4
+ * Explanation: The list = [12 AND 4] = [4]. The XOR sum = 4.
+ * 
+ * Constraints:
+ * 
+ * 	1 <= arr1.length, arr2.length <= 10^5
+ * 	0 <= arr1[i], arr2[j] <= 10^9
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    int getXORSum(vector<int>& arr1, vector<int>& arr2) {
+        int x = arr1[0];
+        for(int i = 1; i < arr1.size(); i++) {
+            x ^= arr1[i];
+        }
+        int y = arr2[0];
+        for(int i = 1; i< arr2.size(); i++) {
+            y ^= arr2[i];
+        }
+        return x&y;
+    }
+};
