Given a non-negative number n. The problem is to toggle the last m bits in the binary representation of n. A toggle operation flips a bit 0 to 1 and a bit 1 to 0.
Constraint: 1 <= m <= n.
Input : n = 21, m = 2 Output : 22 (21)10 = (10101)2 (22)10 = (10110)2 The last two bits in the binary representation of 21 are toggled. Input : n = 107, m = 4 Output : 100
Approach: Following are the steps:
- Calculate num = (1 << m) – 1. This will produce a number num having m number of bits and all will be set.
- Now, perform n = n ^ num. This will toggle the last m bits in n.
This article is contributed by Ayush Jauhari. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Toggle bits of a number except first and last bits
- Toggle all the bits of a number except k-th bit.
- Toggle all bits after most significant bit
- Toggle all odd bits of a number
- Toggle first and last bits of a number
- Toggle all even bits of a number
- Toggle bits in the given range
- For every set bit of a number toggle bits of other
- Check if bits of a number has count of consecutive set bits in increasing order
- Toggle case of a string using Bitwise Operators
- Print numbers having first and last bits as the only set bits
- First and Last Three Bits
- Unset the last m bits
- Swap all odd and even bits
- Set all even bits of a number
Improved By : nitin mittal