Leetcode - Hamming Distance Solution

# Leetcode - Hamming Distance 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

## Solution in Python

class Solution:
def hammingDistance(self, x: int, y: int) -> int:
x_bin = bin(x)[2:].zfill(32)
y_bin = bin(y)[2:].zfill(32)
return sum(1 for x,y in zip(x_bin,y_bin) if x!=y)

## Enjoying these posts? Subscribe for more

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.