Leetcode 3199. Count Triplets with Even XOR Set Bits I

Count the number of index triplets (i<j<k) in an integer array such that the XOR of the three elements has an even number of set bits. Key insight: only the parity of each element's popcount matters, so you can group numbers by even/odd popcount and use combinatorics to count valid triplets.