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$

The key insight behind solving this problem is that the Hamming distance between two integers is simply the number of positions where their bits differ. We can isolate exactly those differing bit positions by performing XOR between x and y, as XOR produces a $1$ at every position where the two inputs differ and a $0$ where they match, for example, 1 ^ 4 gives 101 in binary, where the two 1s directly indicate the $2$ differing bit positions. The problem then reduces to counting ...