Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5704 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3523 |

@mantu_singh | 3510 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1134 |

@gurshehzadsingh | 676 |

@nithinreddy3210 | 610 |

@Run_for_life | 570 |

@divyagupta221100 | 557 |

@jha8768 | 553 |

@AkashLahoty | 537 |

@aayushdesai01 | 526 |

@riyakumaribkj | 524 |

@amansinha74458 | 503 |

@dreamerdreamer | 488 |

Complete Leaderboard |

Given a number n, the task is to find all 1 to n bit numbers with no consecutive 1's in their binary representation.

**Example 1:**

**Input: **n = 3
**Output: **1 2 4 5
**Explanation: **All numbers upto 2 bit are:
1 - 1
2 - 10
3 - 11
4 - 100
5 - 101
6 - 110
7 - 111
Here 3, 6 and 7 have consecutive 1's in their
binary representation.

**Example 2:**

**Input: **n = 2
**Output: **1 2
**Explanation: **All numbers upto 2 bit are:
1 - 1
2 - 10
3 - 11
Here 3 has consecutive 1's in it's
binary representation.

**Your Task:**

You don't need to read or print anything.Your task is to complete the function **numberWithNoConsecutiveOnes() **which takes n as input parameter and returns a list of numbers in increasing order which do not contains 1's in their binary reperesentation.

**Expected Time Complexity:** O(2^{n})

**Expected Space Complexity: **O(n)

**Constraints:**

1 <= n <= 20

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Numbers with alternative 1's

...