Longest subsequence having equal numbers of 0 and 1
Last Updated :
07 Nov, 2022
Given a binary array, the task is to find the size of the largest sub_sequence which having equal number of zeros and one.
Examples :
Input : arr[] = { 1, 0, 0, 1, 0, 0, 0, 1 }
Output: 6
Input : arr[] = { 0, 0, 1, 1, 1, 1, 1, 0, 0 }
Output : 8
simple solution is that we generate all possible sub_sequence and find which sub_sequence have equal number of zeros & one ( it's size should be maximum).
Below is the implementation of above idea
C++
#include <bits/stdc++.h>
using namespace std;
int generateSubsequences(int arr[],
int n)
{
// store the maximum length
// sub_sequence having equal
// number of zeros and ones
int result = 0;
// Number of subsequences is (2**n -1)
unsigned int opsize = pow(2, n);
// Run from counter 000..1 to 111..1
for (int counter = 1; counter < opsize;
counter++)
{
// store count of zeros and one
int countzero = 0;
int countone = 0, current_size = 0;
for (int j = 0; j < n; j++)
{
// Check if jth bit in the
// counter is set. If set
// then print jth element
// from arr[]
if (counter & (1 << j))
{
if (arr[j])
countone++;
else
countzero++;
current_size++;
}
}
// update maximum size
if (countzero == countone)
result = max(current_size,
result);
}
return result;
}
// Driver Code
int main()
{
int arr[] = { 1, 0, 0, 1,
0, 0, 0, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "largest Subsequences having "
"equal number of 0 & 1 is "
<< generateSubsequences(arr, n);
return 0;
}
// Java program for Longest subsequence
// having equal numbers of 0 and 1
import java.io.*;
class GFG {
static int generateSubsequences(int arr[],
int n)
{
// store the maximum length
// sub_sequence having equal
// number of zeros and ones
int result = 0;
// Number of subsequences
// is (2**n -1)
long opsize = (long) Math.pow(2, n);
// Run from counter
// 000..1 to 111..1
for (int counter = 1; counter < opsize;
counter++)
{
// store count of zeros and one
int countzero = 0;
int countone = 0, current_size = 0;
for (int j = 0; j < n; j++)
{
// Check if jth bit in the
// counter is set. If set
// then print jth element
// from arr[]
if ((counter & (1 << j))>0)
{
if (arr[j]>0)
countone++;
else
countzero++;
current_size++;
}
}
// update maximum size
if (countzero == countone)
result = Math.max(current_size,
result);
}
return result;
}
// Driver Code
public static void main (String[] args)
{
int arr[] = { 1, 0, 0, 1,
0, 0, 0, 1 };
int n = arr.length;
System.out.println( "largest Subsequences having "+
"equal number of 0 & 1 is "+
generateSubsequences(arr, n));
}
}
// This code is contributed by anuj_67.
# Python code to find the
# length of longest subsequence
# having equal no of 1 and 0
def generateSubsequences(a, n):
result = 0
# Number of subsequences
# is (2**n -1)
opsize = 2**n
# Run from counter
# 000..1 to 111..1
for counter in range(opsize):
# store count of zeros and one
countzero, countone = 0, 0
current_size = 0
for j in range(n):
# Check if jth bit in the
# counter is set. If set then
# print jth element from arr[]
if counter & (1 << j):
if arr[j] == True:
countone += 1
else:
countzero += 1
current_size += 1
# update maximum size
if countzero == countone:
result = max(current_size,
result)
return result
# Driver code
arr = [ 1, 0, 0, 1, 0, 0, 0, 1 ]
n = len(arr)
print("largest Subsequences having" +
" equal number of 0 & 1 is ",
generateSubsequences(arr, n))
# This code is contributed
# by "Abhishek Sharma 44"
// C# program for Longest subsequence
// having equal numbers of 0 and 1
using System;
class GFG {
static int generateSubsequences(int []arr,
int n)
{
// store the maximum length
// sub_sequence having equal
// number of zeros and ones
int result = 0;
// Number of subsequences
// is (2**n -1)
uint opsize = (uint) Math.Pow(2, n);
// Run from counter
// 000..1 to 111..1
for (int counter = 1; counter < opsize;
counter++)
{
// store count of zeros and one
int countzero = 0;
int countone = 0, current_size = 0;
for (int j = 0; j < n; j++)
{
// Check if jth bit in the
// counter is set. If set
// then print jth element
// from arr[]
if ((counter & (1 << j))>0)
{
if (arr[j]>0)
countone++;
else
countzero++;
current_size++;
}
}
// update maximum size
if (countzero == countone)
result = Math.Max(current_size,
result);
}
return result;
}
// Driver Code
public static void Main ()
{
int []arr = { 1, 0, 0, 1,
0, 0, 0, 1 };
int n = arr.Length;
Console.WriteLine("largest Subsequences having "+
"equal number of 0 & 1 is "+
generateSubsequences(arr, n));
}
}
// This code is contributed by anuj_67.
<?php
// PHP code to find the length
// of longest subsequence have
// equal no of 1 and 0
function generateSubsequences($arr,
$n)
{
// store the maximum length
// sub_sequence having equal
// number of zeros and ones
$result = 0;
// Number of subsequences
// is (2**n -1)
$opsize = pow(2, $n);
// Run from counter 000..1
// to 111..1
for ($counter = 1; $counter < $opsize;
$counter++)
{
// store count of zeros and one
$countzero = 0;
$countone = 0; $current_size = 0;
for ($j = 0; $j < $n; $j++)
{
// Check if jth bit in
// the counter is set
// If set then print jth
// element from arr[]
if ($counter & (1 << $j))
{
if ($arr[$j])
$countone++;
else
$countzero++;
$current_size++;
}
}
// update maximum size
if ($countzero == $countone)
$result = max($current_size,
$result);
}
return $result;
}
// Driver Code
$arr = array(1, 0, 0, 1, 0, 0, 0, 1);
$n = count($arr);
echo "largest Subsequences having " ,
"equal number of 0 & 1 is " ,
generateSubsequences($arr, $n);
// This code is contributed by anuj_67.
?>
<script>
// JavaScript program for Longest subsequence
// having equal numbers of 0 and 1
function generateSubsequences(arr, n)
{
// store the maximum length
// sub_sequence having equal
// number of zeros and ones
var result = 0;
// Number of subsequences is (2**n -1)
var opsize = Math.pow(2, n);
// Run from counter 000..1 to 111..1
for (var counter = 1; counter < opsize;
counter++)
{
// store count of zeros and one
var countzero = 0;
var countone = 0, current_size = 0;
for (var j = 0; j < n; j++)
{
// Check if jth bit in the
// counter is set. If set
// then print jth element
// from arr[]
if (counter & (1 << j))
{
if (arr[j])
countone++;
else
countzero++;
current_size++;
}
}
// update maximum size
if (countzero == countone)
result = Math.max(current_size,
result);
}
return result;
}
// Driver Code
var arr = [ 1, 0, 0, 1,
0, 0, 0, 1 ];
var n = arr.length;
document.write( "largest Subsequences having "+
"equal number of 0 & 1 is "
+ generateSubsequences(arr, n));
</script>
Output:
largest Subsequences having equal number of 0 & 1 is 6
Time Complexity: (n*2^n)
Auxiliary Space: O(1)
Efficient solution is to count zeros & ones in a binary array and last return minimum between count of zeros & ones by multiplying it with 2.
arr[] = { 1, 0, 0, 1, 0, 0, 0, 1 }
output : 6
here largest sub_sequencer :
{ 1 0 0 1 0 1} or {1 0 1 0 0 1 }
If we observe carefully then we notice that
we just have to find minimum counts between
zeros & ones and multiplying it with 2
( because we always get even length sub_sequence)
Below is the implementation of the above idea:
C++
// Efficient CPP program to find
// length of the longest subsequence
// with equal number of 0s and 1s.
#include <bits/stdc++.h>
using namespace std;
int largestSubsequences(int arr[], int n)
{
// store count of zeros and one
int countzero = 0, countone = 0;
// traverse binary array and count
// zeros and ones
for (int i = 0; i < n; i++)
if (arr[i])
countone++;
else
countzero++;
return min(countone, countzero) * 2;
}
// Driver program
int main()
{
int arr[] = { 1, 0, 0, 1, 0, 0, 0, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "largest Subsequences having "
<< "equal number of 0 & 1 is "
<< largestSubsequences(arr, n);
return 0;
}
// Efficient Java program to find
// length of the longest subsequence
// with equal number of 0s and 1s.
import java.io.*;
import java.math.*;
class GFG
{
static int largestSubsequences(int arr[],
int n)
{
// store count of zeros and one
int countzero = 0, countone = 0;
// traverse binary array and count
// zeros and ones
for (int i = 0; i < n; i++)
if (arr[i] == 1)
countone++;
else
countzero++;
return Math.min(countone, countzero) * 2;
}
// Driver Code
public static void main(String args[])
{
int arr[] = { 1, 0, 0, 1, 0, 0, 0, 1 };
int n = arr.length;
System.out.println("largest Subsequences having " +
"equal number of 0 & 1 is " +
largestSubsequences(arr, n));
}
}
// This code is contributed by Nikita Tiwari
# Efficient Python code to find
# length of the longest subsequence
# with equal number of 0s and 1s.
def largestSubsequence(arr,n):
# store count of zeros and one
countzero = 0
countone = 0
# traverse binary array and count
# zeros and ones
for i in range(n):
if arr[i]:
countone += 1
else:
countzero += 1
return min(countone, countzero) * 2
# Driver Code
arr = [ 1, 0, 0, 1, 0, 0, 0, 1 ]
n = len(arr)
print("largest Subsequences having" +
" equal number of 0 & 1 is ",
largestSubsequence(arr, n))
# This code is contributed
# by "Abhishek Sharma 44"
// Efficient C# program to find
// length of the longest subsequence
// with equal number of 0s and 1s.
using System;
class GFG
{
static int largestSubsequences(int[] arr,
int n)
{
// store count of zeros and one
int countzero = 0, countone = 0;
// traverse binary array and
// count zeros and ones
for (int i = 0; i < n; i++)
if (arr[i] != 0)
countone++;
else
countzero++;
return Math.Min(countone,
countzero) * 2;
}
// Driver Code
static void Main()
{
int[] arr = { 1, 0, 0, 1, 0, 0, 0, 1 };
int n = 8 ;
Console.Write("largest Subsequences having" +
" equal number of 0 & 1 is " +
largestSubsequences(arr, n));
}
}
// This code is contributed by Anuj_67
<?php
// Efficient PHP program to find
// length of the longest subsequence
// with equal number of 0s and 1s.
function largestSubsequences( $arr, $n)
{
// store count of zeros and one
$countzero = 0; $countone = 0;
// traverse binary array and
// count zeros and ones
for ( $i = 0; $i < $n; $i++)
if ($arr[$i])
$countone++;
else
$countzero++;
return min($countone, $countzero) * 2;
}
// Driver Code
$arr = array(1, 0, 0, 1,
0, 0, 0, 1);
$n = count($arr);
echo "largest Subsequences having " ,
"equal number of 0 & 1 is " ,
largestSubsequences($arr, $n);
// This code is contributed by Anuj_67.
?>
<script>
// Efficient Javascript program to find
// length of the longest subsequence
// with equal number of 0s and 1s.
function largestSubsequences(arr, n)
{
// store count of zeros and one
var countzero = 0, countone = 0;
// traverse binary array and count
// zeros and ones
for (var i = 0; i < n; i++)
if (arr[i])
countone++;
else
countzero++;
return Math.min(countone, countzero) * 2;
}
// Driver program
var arr = [1, 0, 0, 1, 0, 0, 0, 1 ];
var n = arr.length;
document.write( "largest Subsequences having "
+ "equal number of 0 & 1 is "
+ largestSubsequences(arr, n));
</script>
Outputlargest Subsequences having equal number of 0 & 1 is 6
Time Complexity : O(n)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn 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
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA 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
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem