# Leetcode 461 - Hamming distance

`Note:`

- Use
`XOR`

^ to check if two binary numbers are different on the last digit. - Use
`>>`

to shift. - Be careful of precedence such as
`!==`

has a higher precedence than`&`

.

`Question:`

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 |

`Code:`

1 | /** |