Given two numbers N and M. The task to convert both the numbers in the binary form then add respective bits of both the binary converted numbers but with a given condition that there is not any carry system in this addition.
Input: N = 37, M = 12 Output: 41 Input: N = 456, M = 854 Output: 670
If we don’t consider carry then the binary addition of two bits will be:
1 + 0 = 1 0 + 1 = 1 0 + 0 = 0 1 + 1 = 0 (No carry)
- If you observe clearly you will notice that this is just bitwise XOR of two numbers.
Below is the implementation of the above approach
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.
- 1 to n bit numbers with no consecutive 1s in binary representation.
- 1 to n bit numbers with no consecutive 1s in binary representation
- Position of rightmost bit with first carry in sum of two binary
- Addition of two numbers without carry
- Convert a given Decimal number to its BCD representation
- Maximum 0's between two immediate 1's in binary representation
- XOR counts of 0s and 1s in binary representation
- Find value of k-th bit in binary representation
- Binary representation of a given number
- Largest number with binary representation is m 1's and m-1 0's
- Maximum distance between two 1's in Binary representation of N
- Binary representation of previous number
- Next greater number than N with exactly one bit different in binary representation of N
- Occurrences of a pattern in binary representation of a number
- Check if binary representation of a number is palindrome
- Decimal representation of given binary string is divisible by 20 or not
- Prime Number of Set Bits in Binary Representation | Set 1
- Find the n-th number whose binary representation is a palindrome
- Decimal representation of given binary string is divisible by 10 or not
- Length of the Longest Consecutive 1s in Binary Representation
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.