Leetcode - Hamming Distance Solution — The Poor Coder

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:

Text

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:

Text

Input: x = 3, y = 1
Output: 1

Constraints:

0 <= x, y <= 2³¹ - 1

Solution in Python#

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)

May 112021

Leetcode - XOR Operation in an Array Solution

Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise XOR of all elements of nums. Example 1: Example 2: Example 3: Example 4…

leetcode array Bit Manipulation1 min read

May 062021

Leetcode - Number of Steps to Reduce a Number to Zero Solution

Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. Example 1: Example 2: Example 3…

leetcode Bit Manipulation1 min read

Mar 222021

Leetcode - Power of Four Solution

Given an integer n, return true if it is a power of four. Otherwise, return false. An integer n is a power of four, if there exists an integer x such that n == 4x. Example 1: Example 2: Example 3: Constraints: -231 <= n…

leetcode Bit Manipulation1 min read

Solution in Python#

Related posts

Leetcode - XOR Operation in an Array Solution

Leetcode - Number of Steps to Reduce a Number to Zero Solution

Leetcode - Power of Four Solution