Create 2425. Bitwise XOR of All Pairings (#690)

Author: Chayandas07

2425. Bitwise XOR of All Pairings

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int xorAllNums(vector<int>& nums1, vector<int>& nums2) {
+        int n1=nums1.size(), n2=nums2.size();
+        unordered_map<int,long>freq;
+        for(int n:nums1) freq[n]+=n2;
+        for(int n:nums2) freq[n]+=n1;
+        int res=0;
+        for(auto& [n,c]:freq){
+            if(c%2==1) res^=n;
+        }
+        return res;
+    }
+};