The Hamming distance between two integers is defined as the number of bit positions where the corresponding bits of the two numbers differ.

Given two integers x and y, your task is to find and return the Hamming distance between them.

Constraints:

• $0 \leq$ x, y $\leq 2^{31} - 1$

Now, let's take a moment to make sure you've correctly understood the problem. The quiz below helps you check if you're solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.