Generate all Binary Strings of length N with equal count of 0s and 1s
Last Updated :
29 Dec, 2021
Given an integer N, the task is to generate all the binary strings with equal 0s and 1s. If no strings are possible, print -1
Examples:
Input: N = 2
Output: “01”, “10”
Explanation: All possible binary strings of length 2 are: 01, 10, 11, 00. Out of these, only 2 have equal number of 0s and 1s
Input: 4
Output: “0011”, “0101”, “0110”, “1100”, “1010”, “1001”
Approach: The task can be solved by using recursion. If N is odd, then the answer is -1, else, we can use recursion to generate all the binary strings with equal 0s and 1s. Follow the below steps to solve the problem:
- Variable ones keep track of the number of 1's and variable zeros keeps a track of the number of 0's in the string.
- Both ones and zeros should have frequency N/2.
- Base condition: The string s stores the output string. So, when the length of s reaches N we stop recursive calls and print the output string s.
- If the frequency of 1's is less than N/2 then add 1 to the string and increment ones.
- If the frequency of 0's is less than N/2 then add 0 to the string and increment zeros.
Below is the implementation of the above code:
C++
// C++ code for the above approach
#include <bits/stdc++.h>
using namespace std;
// Recursive function that prints
// all strings of N length with equal 1's and 0's
void binaryNum(int n, string s, int ones,
int zeros)
{
// String s contains the output to be printed
// ones stores the frequency of 1's
// zeros stores the frequency of 0's
// Base Condition: When the length of string s
// becomes N
if (s.length() == n)
{
cout << (s) << endl;
return;
}
// If frequency of 1's is less than N/2 then
// add 1 to the string and increment ones
if (ones < n / 2)
binaryNum(n, s + "1", ones + 1, zeros);
// If frequency of 0's is less than N/2 then
// add 0 to the string and increment zeros
if (zeros < n / 2)
binaryNum(n, s + "0", ones, zeros + 1);
}
// Driver Code
int main()
{
string s = "";
binaryNum(4, s, 0, 0);
return 0;
}
// This code is contributed by Potta Lokesh
Java
// Java program for the above approach
import java.io.*;
class GFG {
// Recursive function that prints
// all strings of N length with equal 1's and 0's
static void binaryNum(int n, String s, int ones,
int zeros)
{
// String s contains the output to be printed
// ones stores the frequency of 1's
// zeros stores the frequency of 0's
// Base Condition: When the length of string s
// becomes N
if (s.length() == n) {
System.out.println(s);
return;
}
// If frequency of 1's is less than N/2 then
// add 1 to the string and increment ones
if (ones < n / 2)
binaryNum(n, s + "1", ones + 1, zeros);
// If frequency of 0's is less than N/2 then
// add 0 to the string and increment zeros
if (zeros < n / 2)
binaryNum(n, s + "0", ones, zeros + 1);
}
// Driver Code
public static void main(String[] args)
{
String s = "";
binaryNum(4, s, 0, 0);
}
}
Python3
# python code for the above approach
# Recursive function that prints
# all strings of N length with equal 1's and 0's
def binaryNum(n, s, ones, zeros):
# String s contains the output to be printed
# ones stores the frequency of 1's
# zeros stores the frequency of 0's
# Base Condition: When the length of string s
# becomes N
if (len(s) == n):
print(s)
return
# If frequency of 1's is less than N/2 then
# add 1 to the string and increment ones
if (ones < n / 2):
binaryNum(n, s + "1", ones + 1, zeros)
# If frequency of 0's is less than N/2 then
# add 0 to the string and increment zeros
if (zeros < n / 2):
binaryNum(n, s + "0", ones, zeros + 1)
# Driver Code
if __name__ == "__main__":
s = ""
binaryNum(4, s, 0, 0)
# This code is contributed by rakeshsahni
C#
// C# program for the above approach
using System;
class GFG {
// Recursive function that prints
// all strings of N length with equal 1's and 0's
static void binaryNum(int n, string s, int ones,
int zeros)
{
// String s contains the output to be printed
// ones stores the frequency of 1's
// zeros stores the frequency of 0's
// Base Condition: When the length of string s
// becomes N
if (s.Length == n) {
Console.WriteLine(s);
return;
}
// If frequency of 1's is less than N/2 then
// add 1 to the string and increment ones
if (ones < n / 2)
binaryNum(n, s + "1", ones + 1, zeros);
// If frequency of 0's is less than N/2 then
// add 0 to the string and increment zeros
if (zeros < n / 2)
binaryNum(n, s + "0", ones, zeros + 1);
}
// Driver Code
public static void Main(string[] args)
{
string s = "";
binaryNum(4, s, 0, 0);
}
}
// This code is contributed by ukasp.
JavaScript
<script>
// javascript program for the above approach
// Recursive function that prints
// all strings of N length with equal 1's and 0's
function binaryNum(n, s, ones, zeros)
{
// String s contains the output to be printed
// ones stores the frequency of 1's
// zeros stores the frequency of 0's
// Base Condition: When the length of string s
// becomes N
if (s.length == n) {
document.write(s+"<br>");
return;
}
// If frequency of 1's is less than N/2 then
// add 1 to the string and increment ones
if (ones < n / 2)
binaryNum(n, s + "1", ones + 1, zeros);
// If frequency of 0's is less than N/2 then
// add 0 to the string and increment zeros
if (zeros < n / 2)
binaryNum(n, s + "0", ones, zeros + 1);
}
// Driver Code
var s = "";
binaryNum(4, s, 0, 0);
// This code is contributed by 29AjayKumar
</script>
Output1100
1010
1001
0110
0101
0011
Time Complexity: O(2N)
Auxiliary Space: O(1)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
12 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
Linked List Data Structure A linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read