Given two integers(less than 2^31) A and B. The task is to find the number of bits that are different in their binary representation.
Input : A = 12, B = 15 Output : Number of different bits : 2 Explanation: The binary representation of 12 is 1100 and 15 is 1111. So, the number of different bits are 2. Input : A = 3, B = 16 Output : Number of different bits : 3
- Run a loop from ‘0’ to ’31’ and right shift the bits of A and B by ‘i’ places, then check whether the bit at the ‘0th’ position is different.
- If the bit is different then increase the count.
- As the numbers are less than 2^31, we only have to run the loop ’32’ times i.e. from ‘0’ to ’31’.
- We can get the 1st bit if we bitwise AND the number by 1.
- At the end of the loop display the count.
Below is the implementation of the above approach:
Number of different bits : 2
- Prime Number of Set Bits in Binary Representation | Set 1
- Binary representation of a given number
- Count number of trailing zeros in Binary representation of a number using Bitset
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Binary representation of previous number
- Sum of digits with even number of 1's in their binary representation
- Largest number with binary representation is m 1's and m-1 0's
- Next greater number than N with exactly one bit different in binary representation of N
- Number of integers with odd number of set bits
- Number of leading zeros in binary representation of a given number
- Find the n-th number whose binary representation is a palindrome
- Occurrences of a pattern in binary representation of a number
- Check if binary representation of a number is palindrome
- Find the number obtained after concatenation of binary representation of M and N
- Check if binary representation of a given number and its complement are anagram
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.