Toggle the last m bits Last Updated : 31 May, 2022 Comments Improve Suggest changes Like Article Like Report 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. Examples: 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. C++ // C++ implementation to // toggle the last m bits #include <bits/stdc++.h> using namespace std; // function to toggle // the last m bits unsigned int toggleLastMBits (unsigned int n, unsigned int m) { // calculating a number // 'num' having 'm' bits // and all are set. unsigned int num = (1 << m) - 1; // toggle the last m bits // and return the number return (n ^ num); } // Driver code int main() { unsigned int n = 107; unsigned int m = 4; cout << toggleLastMBits(n, m); return 0; } Java // Java implementation to // toggle the last m bits import java.util.*; import java.lang.*; public class GfG{ // function to toggle // the last m bits public static int toggleLastMBits (int n, int m) { // calculating a number // 'num' having 'm' bits // and all are set int num = (1 << m) - 1; // toggle the last m bits // and return the number return (n ^ num); } // Driver function public static void main(String argc[]){ int n = 107; int m = 4; n = toggleLastMBits(n, m); System.out.println(n); } } // This code is contributed by Sagar Shukla. Python3 # Python implementation to # toggle the last m bits # function to toggle # the last m bits def toggleLastMBits(n,m): # calculating a number # 'num' having 'm' bits # and all are set. num = (1 << m) - 1 # toggle the last m bits # and return the number return (n ^ num) # Driver code n = 107 m = 4 print(toggleLastMBits(n, m)) # This code is contributed # by Anant Agarwal. C# // C# implementation to // toggle the last m bits using System; namespace Toggle { public class GFG { // Function to toggle the last m bits public static int toggleLastMBits(int n, int m) { // Calculating a number 'num' having // 'm' bits and all are set int num = (1 << m) - 1; // Toggle the last m bits // and return the number return (n ^ num); } // Driver Code public static void Main() { int n = 107, m = 4; n = toggleLastMBits(n, m); Console.Write(n); } } } // This code is contributed by Sam007. PHP <?php // PHP implementation to // toggle the last m bits // function to toggle // the last m bits function toggleLastMBits($n, $m) { // calculating a number // 'num' having 'm' bits // and all are set. $num = (1 << $m) - 1; // toggle the last m bits // and return the number return ($n ^ $num); } // Driver code { $n = 107; $m = 4; echo toggleLastMBits($n, $m); return 0; } // This code is contributed by nitin mittal. ?> JavaScript <script> // Javascript implementation to // toggle the last m bits // function to toggle // the last m bits function toggleLastMBits(n, m) { // calculating a number // 'num' having 'm' bits // and all are set. var num = (1 << m) - 1; // toggle the last m bits // and return the number return (n ^ num); } // Driver code var n = 107; var m = 4; document.write( toggleLastMBits(n, m)); </script> Output: 100 Time Complexity : O(1) Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Toggle the last m bits A Ayush Improve Article Tags : Bit Magic DSA Practice Tags : Bit Magic Similar Reads Unset the last m bits Given a non-negative number n. The problem is to unset the last m bits in the binary representation of n.Constraint: 1 <= m <= num, where num is the number of bits in the binary representation of n. Examples: Input : n = 10, m = 2 Output : 8 (10)10 = (1010)2 (8)10 = (1000)2 The last two bits i 6 min read Toggle bits in the given range Given a non-negative number n and two values l and r. The problem is to toggle the bits in the range l to r in the binary representation of n, i.e., to toggle bits from the lth least significant bit bit to the rth least significant bit (the rightmost bit as counted as first bit). A toggle operation 9 min read Toggle first and last bits of a number Given a number n, the task is to toggle only first and last bits of a numberExamples : Input : 10 Output : 3 Binary representation of 10 is 1010. After toggling first and last bits, we get 0011. Input : 15 Output : 6 Prerequisite : Find MSB of given number.1) Generate a number which contains first a 8 min read Toggling k-th bit of a number For a given number n, if k-th bit is 0, then toggle it to 1 and if it is 1 then, toggle it to 0.Examples : Input : n = 6, k = 1Output : 76 is represented as 110 in binary and has its first bit 0, so toggling it will result in 111 i.e. 7.Input : n = 2, k = 3Output : 62 is represented as 010 in binary 3 min read Set the Left most unset bit Given an integer, set the leftmost unset bit. Leftmost unset bit is the first unset bit after most significant set bit. If all bits (after most significant set bit) are set, then return the number. Examples: Input : 10 Output : 14 10 = 1 0 1 0 // 10 binary 14 = 1 1 1 0 // after set left most unset b 5 min read Like