Sum of bit differences GFG POTD Python Solution today geeks for geeks problem of the day python
Problem - https://www.geeksforgeeks.org/problem...
Medium - / sum-of-bit-differences-gfg-potd
Given an array integers arr[], containing n elements, find the sum of bit differences between all pairs of element in the array. Bit difference of a pair (x, y) is the count of different bits at the same positions in binary representations of x and y.
For example, bit difference for 2 and 7 is 2. Binary representation of 2 is 010 and 7 is 111 respectively and the first and last bits differ between the two numbers.
Note: (x, y) and (y, x) are considered two separate pairs.
Example 1:
Input:
n = 2
arr[] = {1, 2}
Output: 4
Explanation: All possible pairs of an array are (1, 1), (1, 2), (2, 1), (2, 2).
Sum of bit differences = 0 + 2 + 2 + 0
= 4
Example 2:
Input:
n = 3
arr[] = {1, 3, 5}
Output: 8
Explanation:
All possible pairs of an array are (1, 1), (1, 3), (1, 5), (3, 1), (3, 3) (3, 5),(5, 1), (5, 3), (5, 5).
Sum of bit differences = 0 + 1 + 1 + 1 + 0 + 2 + 1 + 2 + 0
= 8