Given an integer array of
n integers, find sum of bit differences in all pairs that can be formed from array elements. Bit difference of a pair
(x, y) is count of different bits at same positions in binary representations of
y. For example, bit difference for
2. Binary representation of
(x, y) and
(y, x) should be counted seperately.