Given a number N. The task is to find the smallest number which is greater than N and has only one bit different in the binary representation of N.
Note: Here N can be very large 10^9 < N < 10^15.
Input : N = 11 Output : The next number is 15 The binary representation of 11 is 1011 So the smallest number greater than 11 with one bit different is 1111 which is 15. Input : N = 17 Output : The next number is 19
Simple Approach: We will run a loop from N+1 until we find a number which has exactly one bit different than N. This process might take a long time to process in case of large numbers
Efficient Approach: In the efficient approach we have to represent the number in its binary form. Now a number greater than N with only 1 bit different is only possible when we keep all the set bits of the number N intact and switch the lowest possible bit which is zero to 1.
Let us take the example, 1001 which is binary form of 9,
If we switch the set bits of 1001 to either 1000 or 0001 then we find that the numbers are 8 and 1 which are less than N. While if we turn the bits which are zero to 1 we find the numbers are 11 (1011) or 13 (1101) so if switch the lowest possible bit which is zero to 1 then we get the smallest possible number greater than N with only 1 bit different, in this case it is 11 (1011).
Note: It is guaranteed that the input number N does not have all of its bits as set. There exists at least one unset bit in the binary representation of N.
Below is the implementation of the above approach:
# Python3 program to find next greater
# number than N with exactly one
# bit different in binary
# representation of N
# Function to find next greater
# number than N with exactly
# one bit different in binary
# representation of N
power_of_2 = 1;
shift_count = 0;
# It is guaranteed that there
# is a bit zero in the number
# If the shifted bit is
# zero then break
if (((N >> shift_count) & 1) % 2 == 0):
# increase the bit shift
shift_count += 1;
# increase the power of 2
power_of_2 = power_of_2 * 2;
# set the lowest bit
# of the number
return (N + power_of_2);
# Driver code
N = 11;
# display the next number
print(“The next number is =”,
# This code is contributed by mits
The next number is = 15
Time Complexity: O(log(N))
- Binary representation of a given number
- Count number of trailing zeros in Binary representation of a number using Bitset
- Check if the binary representation of a number has equal number of 0s and 1s in blocks
- Binary representation of previous number
- Largest number with binary representation is m 1's and m-1 0's
- Number of leading zeros in binary representation of a given number
- Prime Number of Set Bits in Binary Representation | Set 1
- Check if binary representation of a number is palindrome
- Prime Number of Set Bits in Binary Representation | Set 2
- Find the n-th number whose binary representation is a palindrome
- Occurrences of a pattern in binary representation of a number
- Sum of decimal equivalent of all possible pairs of Binary representation of a Number
- Find consecutive 1s of length >= n in binary representation of a number
- Number of mismatching bits in the binary representation of two integers
- Check if binary representation of a given number and its complement are anagram
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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.