Magical Pairs in Array - Coding Interview

Problem Two numbers form a "magical pair" if their bitwise XOR equals their absolute difference. Given an array, count the number of such pairs (i, j) with i < j. Example: Mathematical insight: For non-negative integers, a XOR b == |a - b| if and only if one number is a prefix of the other in binary (i.e., the larger has all bits of the smaller, plus possibly more -- which means the numbers share no overlapping set bits, i.e., (a & b) == 0). Follow-ups Use the insight above to solve in O(n log n…