Solving Total Hamming Distance in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Now your job is to find the total Hamming distance between all pairs of the given numbers.

Example:

Input: 4, 14, 2

Output: 6

Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
showing the four bits relevant in this case). So the answer will be:
HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.

Note:

See the full details of the problem Total Hamming Distance at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go