1310. XOR Queries of a Subarray

 

 

https://leetcode.com/problems/xor-queries-of-a-subarray/

 

Source

class Solution {
public:
    vector<int> xorQueries(vector<int>& arr, vector<vector<int>>& queries) {
        vector<int> result;
        for (int i = 0; i < queries.size(); i++) {
            int left  = queries[i][0];
            int right = queries[i][1];
            int cand = arr[left];
            for (int j = left; j < right; j++) {
                cand = cand ^ arr[j+1];
            }
            result.push_back(cand);
        }
        return result;
    }
};