Timer is Running

C++ Nega Bit
Submissions: 7   Accuracy:


  Difficulty: Basic   Marks: 1

Given two integer numbers, F and S. In binary form of the numbers, for every ith set bit in F, negate the i th bit in S.

Example 1:

F = 2 , S = 5
2 is represented as 10 in binary and
5 is represented as 101. Hence negating
the 2nd bit of 5 from right, thus the
new number becomes 7 i.e. 111. 

Example 2:

F = 1 , S = 3
1-1 and 3-11 in binary, thus negating
1st bit of 3 from right we get 10 i.e. 2. 


Your Task:
You don't need to read input or print anything. Your task is to complete the function negaBit() which takes 2 Integers F and S as input and returns the modified S.

Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)


1 <= F,S <= 106

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Vanshika
Author: vanshi_14

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.