Leetcode 2588. Count the Number of Beautiful Subarrays

Count the number of contiguous subarrays whose bitwise XOR is 0 (equivalently, every bit appears an even number of times in the subarray). This reduces to counting pairs of equal prefix XORs (use a hash map for an O(n) solution; n ≤ 1e5).