For every set bit of a number toggle bits of other

0 0 2 minutes read

Given two integer numbers, whenever the bits of the first number is set i.e. 1, toggle the bits of the second number leaving the rest bits of the second number unchanged.

Examples :

Input: 2 5
Output: 7
2 is represented as 10 in binary and 5 
is represented as 101. Hence toggling the 
2nd bit of 5 from right, thus the new 
number becomes 7 i.e. 111

Input: 1 3
Output: 2

Approach:
Just do XOR of the given two Number.

C++

// A CPP program toggle bits of n2 
// that are at same position as set 
// bits of n1.
#include <bits/stdc++.h>
using namespace std;
 
// function for the Nega_bit
int toggleBits(int n1, int n2)
{
    return n1 ^ n2;
}
 
// Driver program to test above
int main()
{
    int n1 = 2, n2 = 5;
    cout << toggleBitst(n1, n2) << endl;
    return 0;
}

Java

// A Java program toggle bits of n2 
// that are at same position as set 
// bits of n1.
import java.io.*;
 
class GFG {
     
    // function for the Nega_bit
    static int toggleBits(int n1, int n2)
    {
        return (n1 ^ n2);
    }
     
    // Driver program 
    public static void main(String args[])
    {
        int n1 = 2, n2 = 5;
        System.out.println(toggleBits(n1, n2));
    }
}
 
 
 
 
// This code is contributed
// by Nikita Tiwari.

Python3

# A Python 3 program toggle bits of n2 
# that are at same position as set 
# bits of n1.
 
     
# function for the Nega_bit
def toggleBits(n1, n2) :
    return (n1 ^ n2)
 
 
# Driver program to test above
n1 = 2
n2 = 5
 
print(toggleBits(n1, n2))
 
# This code is contributed 
# by Nikita Tiwari.

C#

// C# program toggle bits of n2 
// that are at same position as set 
// bits of n1.
using System;
 
class GFG {
      
    // function for the Nega_bit
    static int toggleBits(int n1, int n2)
    {
        return (n1 ^ n2);
    }
      
    // Driver program 
    public static void Main()
    {
         
        int n1 = 2, n2 = 5;
         
        Console.WriteLine(toggleBits(n1, n2));
    }
}
  
// This code is contributed by Anant Agarwal.

PHP

<?php
// PHP program to toggle bits of n2 
// that are at same position as set 
// bits of n1.
 
// function for the Nega_bit
function toggleBits($n1, $n2)
{
    return $n1 ^ $n2;
}
 
// Driver code
$n1 = 2;
$n2 = 5;
echo toggleBits($n1, $n2)."\n";
 
// This code is contributed by mits 
?>

Javascript

<script>
 
// JavaScript program toggle bits of n2 
// that are at same position as set 
// bits of n1
 
// Function for the Nega_bit
function toggleBits(n1, n2)
{
    return (n1 ^ n2);
}   
 
// Driver code
let n1 = 2, n2 = 5;
document.write(toggleBits(n1, n2));
 
// This code is contributed by sanjoy_62
 
</script>

Output :

Time Complexity : O(1)

Auxiliary Space: O(1)

Recommended

Solve DSA problems on GfG Practice.

Solve Problems

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!