Easy

Quiz

#461 Hamming Distance

APPROACH

Given two integers x and y, count the number of positions at which the corresponding bits in their binary representations differ. Return that count, which is their Hamming distance.

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

1 of 4

1:00

What is the optimal approach for this problem?