{"id":742,"date":"2025-07-22T13:10:56","date_gmt":"2025-07-22T07:40:56","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=742"},"modified":"2025-07-22T13:10:58","modified_gmt":"2025-07-22T07:40:58","slug":"generate-all-binary-strings","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/generate-all-binary-strings\/","title":{"rendered":"Generate All Binary Strings | Backtracking Approach"},"content":{"rendered":"\n

Given an integer N<\/strong> , Print all binary strings of size N which do not contain consecutive 1s.<\/p>\n\n\n\n

A binary string is that string which contains only 0 and 1.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example 1:<\/strong>
Input:<\/strong>
N = 3
Output:<\/strong>
000 , 001 , 010 , 100 , 101
Explanation:<\/strong>
None of the above strings contain consecutive 1s. \"110\" is not an answer as it has '1's occuring consecutively. <\/pre>\n\n\n\n
Your Task:<\/strong><\/p>\n\n\n\n
You don’t need to read input or print anything. Your task is to complete the function generateBinaryStrings()<\/strong> which takes an integer N <\/strong>as input and returns a list of all valid binary strings in lexicographically increasing order.<\/p>\n\n\n\n
Expected Time Complexity:<\/strong> O(2N<\/sup>)
Expected Auxiliary Space:<\/strong> O(N)<\/p>\n\n\n\n
Constraints:<\/strong>
1 <= N <= 20<\/p>\n\n\n
\n\t\t\t
\n\t\t\t\t
Contents:<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
\n\t\t\t
\n\t\t\t\t