Hard

Find XOR Sum of All Pairs Bitwise ANDC++

Full explanation · Time O(n) · Space O(1)

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    int getXORSum(vector<int>& arr1, vector<int>& arr2) {
        const auto& op = [](int total, int x) { return total ^ x; };
        return accumulate(cbegin(arr1), cend(arr1), 0, op) &
               accumulate(cbegin(arr2), cend(arr2), 0, op);
    }
};