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 :
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Comparing leading zeros in binary representations of two numbers
- Minimum flips in two binary arrays so that their XOR is equal to another array
- Count pairs from 1 to N such that their Sum is divisible by their XOR
- Find two numbers from their sum and XOR
- Maximum sum of Bitwise XOR of all elements of two equal length subsets
- Count ordered pairs of positive numbers such that their sum is S and XOR is K
- Find XOR of two number without using XOR operator
- Count all Quadruples from four arrays such that their XOR equals to 'x'
- Find number of pairs in an array such that their XOR is 0
- Find a number M < N such that difference between their XOR and AND is maximum
- Largest number M having bit count of N such that difference between their OR and XOR value is maximized
- Minimum Bitwise XOR operations to make any two array elements equal
- Count of elements which are equal to the XOR of the next two elements
- Count numbers whose sum with x is equal to XOR with x
- Count numbers whose difference with N is equal to XOR with N
- Count numbers whose XOR with N is equal to OR with N
- Equal Sum and XOR of three Numbers
- Given a set, find XOR of the XOR's of all subsets.
- Choose X such that (A xor X) + (B xor X) is minimized
- XOR of path between any two nodes in a Binary Tree
Improved By : Mithun Kumar