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

Problem Description

Example:

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)

The above arrows point to positions where the corresponding bits are different.

See the full details of the problem Hamming Distance at LeetCode

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