Generate Binary Strings Without Adjacent Zeros
You are given a positive integer n.
A binary string x is valid if all substrings of x of length 2 contain at least one "1".
Return all valid strings with length n, in any order.
Example 1
Input
n = 3Output
["010","011","101","110","111"]The valid strings of length 3 are: "010", "011", "101", "110", and "111".
Example 2
Input
n = 1Output
["0","1"]The valid strings of length 1 are: "0" and "1".
Constraints
- 1 <= n <= 18
Asked at 4 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.