The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, calculate the Hamming distance between them.

Function Signature:

def int_hamming_distance(x: int, y: int) -> int:
    """
    Calculate the Hamming distance between two integers.

    Parameters:
    - x: An integer.
    - y: An integer.

    Returns:
    - int: The Hamming distance between x and y.
    """
    # Your code here

Example:

x = 1
y = 4
result = int_hamming_distance(x, y)
print(result)  # Output should be 2
# Explanation: The binary representation of 1 is 0001, and the binary representation of 4 is 0100.
# The Hamming distance between the two is 2, as there are two positions where the bits are different.

Note:

  • 0 ≤ x, y < 2^31

Instructions:

  • Implement the int_hamming_distance function to solve the problem.
  • Use Python for your implementation.
  • Provide clear comments in your code to explain the logic.
  • Discuss the time and space complexity of your solution.

As always, we’ll share our solution to this problem tomorrow. Stay tuned 😊