Binary Strings Without Two Ones in a Row
Beginner
Return every binary string of length n (made of 0 and 1) that does not contain two 1s next to each other, in dictionary order. For n = 3: 000, 001, 010, 100, 101. For n = 0 the answer is the single empty string [""].
Examples
Example 1
Input:
no_adjacent_ones(3)
Output:
['000', '001', '010', '100', '101']
Example 2
Input:
no_adjacent_ones(0)
Output:
['']
Constraints
0 <= n <= 16- The answer has about
1.6^nstrings (4,181 forn = 18).
Theory
Go to TheoryKeywords
dsa-sheetrecursionbacktracking-puzzles
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.