Given two numbers say a and b. Print their XOR after making the lengths of their binary representation equal by adding trailing zeros to the binary representation of smaller one.
Input : a = 13, b = 5 Output : 7 Explanation : Binary representation of 13 is 1101 and of 5 is 101. As the length of "101" is smaller, so add a '0' to it making it "1010', to make the length of binary representations equal. XOR of 1010 and 1101 gives 0111 which is 7. Input : a = 7, b = 5 Output : 2 Explanation : Since the length of binary representations of 7 i.e, 111 and 5 i.e, 101 are same, hence simply print XOR of a and b.
Approach : Count the number of bits in binary representation of smaller number out of a and b. If the number of bits in smaller number(say a) exceeds to that of larger number(say b), then apply left shift to the smaller number by the number of exceeding bits, i.e, a = a<<(exceeding bits). After applying left shift, trailing zeroes will be added at the end of binary representation of smaller number to make the number of bits in binary representation of both the numbers equal. XOR both the binary representations to get the final result.
Below is the implementation of above method :
- Check if binary representations of two numbers are anagram
- Comparing leading zeros in binary representations of two numbers
- First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
- Length of the Longest Consecutive 1s in Binary Representation
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- Find consecutive 1s of length >= n in binary representation of a number
- Equal Sum and XOR of three Numbers
- Length of longest consecutive zeroes in the binary representation of a number.
- Numbers whose bitwise OR and sum with N are equal
- Count numbers whose sum with x is equal to XOR with x
- Count numbers whose XOR with N is equal to OR with N
- Minimum flips in two binary arrays so that their XOR is equal to another array
- Count numbers whose difference with N is equal to XOR with N
- Find N distinct numbers whose bitwise Or is equal to K
- Check if two numbers are equal without using comparison operators
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.
Improved By : Mithun Kumar