Watch 10 video solutions for Hamming Distance, a easy level problem involving Bit Manipulation. This walkthrough by Kevin Naughton Jr. has 23,406 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y, return the Hamming distance between them.
Example 1:
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.
Example 2:
Input: x = 3, y = 1 Output: 1
Constraints:
0 <= x, y <= 231 - 1
Note: This question is the same as 2220: Minimum Bit Flips to Convert Number.