Given a number n, our task is to find all 1 to n bit numbers with no consecutive 1s in their binary representation.
Input : n = 4 Output : 1 2 4 5 8 9 10 These are numbers with 1 to 4 bits and no consecutive ones in binary representation. Input : n = 3 Output : 1 2 4 5
1) There will be 2n numbers with number of bits from 1 to n.
2) Iterate through all 2n numbers. For every number check if it contains consecutive set bits or not. To check, we do bit wise and of current number i and left shifted i. If the bitwise and contains a non-zero bit (or its value is non-zero), then given number doesn’t contain consecutive set bits.
Complexity O(2^n) because ‘for’ loop is run 2^n time.
1 2 4 5
This article is contributed by Devanshu Agarwal. 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- 1 to n bit numbers with no consecutive 1s in binary representation.
- Length of the Longest Consecutive 1s in Binary Representation
- Find consecutive 1s of length >= n in binary representation of a number
- Length of longest consecutive zeroes in the binary representation of a number.
- Maximum number of consecutive 1's in binary representation of all the array elements
- Convert numbers into binary representation and add them without carry
- Fibbinary Numbers (No consecutive 1s in binary)
- Fibbinary Numbers (No consecutive 1s in binary) - O(1) Approach
- XOR counts of 0s and 1s in binary representation
- Maximum 0's between two immediate 1's in binary representation
- Binary representation of a given number
- Find value of k-th bit in binary representation
- Largest number with binary representation is m 1's and m-1 0's
- Next greater number than N with exactly one bit different in binary representation of N
- Maximum distance between two 1's in Binary representation of N