LeetCode Solutions/LeetCoding Challenge/November 2021 LeetCoding Challenge/Hamming Distance.java
class Solution {
    public int hammingDistance(int x, int y) {
        int hammingDistance = 0;
        for(int i=0; i<32; i++){
            if((x&1) != (y&1)){
                hammingDistance++;
            }
            x = x>>1;
            y = y>>1;
        }
        return hammingDistance;
    }
}