Search
⌘K
Get Premium
Leetcode 3211. Generate Binary Strings Without Adjacent Zeros
Generate all binary strings of length n that contain no adjacent zeros (i.e., every length-2 substring contains at least one '1'), returning them in any order. This is typically done by building strings incrementally (backtracking/DFS); the solution size grows like Fibonacci so n ≤ 18 is feasible.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.