Please enable JavaScript.

Coggle requires JavaScript to display documents.

Interview Preparation (Code/Tech) (Java (Easy (Maximum Product of Three…

- - - - Using the bitwise XOR for two integers ^
        
        Using the bitwise AND & with 1 to the get the result for the first digit
        
        >> for bit shift
        
        while loop still until zero
        
        Complexity O(n)
        
        Pitfalls: int cannot be converted to boolean!
        
        while (var) // this is not true when var is an integer
    - - java.lang.Math.abs()
  - - - But normally you just return the value
      - Or simply create a single element array
- - - - One line solution
        
        class Solution:
        def hammingDistance(self, x, y):
        return bin(x^y).count('1')