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.