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 from 0 to 1 and a bit from 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 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 write.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.
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. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer Geeks Classes Live