Minimum no. of operations required to make all Array Elements Zero
Last Updated :
02 Sep, 2022
Given an array of N elements and each element is either 1 or 0. You need to make all the elements of the array equal to 0 by performing the below operations:
- If an element is 1, You can change it's value equal to 0 then,
- if the next consecutive element is 1, it will automatically get converted to 0.
- if the next consecutive element is already 0, nothing will happen.
Now, the task is to find the minimum number of operations required to make all elements equal to 0.
Examples:
Input : arr[] = {1, 1, 0, 0, 1, 1, 1, 0, 0, 1}
Output : Minimum changes: 3
Input : arr[] = {1, 1, 1, 1}
Output : Minimum changes: 1
Approach 1: To find the minimum number of changes required, iterate the array from left to right and check if the current element is 1 or not. If the current element is 1, then change it to 0 and increment the count by 1 and search for the 0 for the next operation as all consecutive 1's will be automatically converted to 0.
Implementation:
C++
// CPP program to find minimum number of
// operations required to make all
// array elements zero
#include <bits/stdc++.h>
using namespace std;
// Function to find minimum number of
// operations required to make all
// array elements zero
int minimumChanges(int arr[], int n)
{
int i;
// It will maintain total changes required
int changes = 0;
for (i = 0; i < n; i++)
{
// Check for the first 1
if (arr[i] == 1)
{
int j;
// Check for number of
// consecutive 1's
for(j = i+1; j<n; j++)
{
if(arr[j]==0)
break;
}
// Increment i to the position of
// last consecutive 1
i = j-1;
changes++;
}
}
return changes;
}
// Driver code
int main()
{
int arr[] = { 1, 1, 0, 0, 0, 1, 0, 1, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Minimum operations: " << minimumChanges(arr, n);
return 0;
}
// Java program to find minimum
// number of operations required
// to make all array elements zero
class GFG
{
// Function to find minimum number
// of operations required to make
// all array elements zero
static int minimumChanges(int arr[],
int n)
{
int i;
// It will maintain total
// changes required
int changes = 0;
for (i = 0; i < n; i++)
{
// Check for the first 1
if (arr[i] == 1)
{
int j;
// Check for number of
// consecutive 1's
for(j = i + 1; j < n; j++)
{
if(arr[j] == 0)
break;
}
// Increment i to the position
// of last consecutive 1
i = j - 1;
changes++;
}
}
return changes;
}
// Driver code
public static void main (String args[])
{
int arr[] = { 1, 1, 0, 0, 0,
1, 0, 1, 1 };
int n = arr.length ;
System.out.println("Minimum operations: " +
minimumChanges(arr, n));
}
}
// This code is contributed by ANKITRAI1
# Python 3 program to find
# minimum number of operations
# required to make all array
# elements zero
# Function to find minimum number
# of operations required to make
# all array elements zero
def minimumChanges(arr, n) :
# It will maintain total
# changes required
changes = 0
i = 0
while i < n :
# Check for the first 1
if arr[i] == 1 :
j = i + 1
# Check for number of
# consecutive 1's
while j < n:
if arr[j] == 0 :
break
j += 1
# Increment i to the position
# of last consecutive 1
i = j - 1
changes += 1
i += 1
return changes
# Driver code
if __name__ == "__main__" :
arr = [ 1, 1, 0, 0, 0, 1, 0, 1, 1]
n = len(arr)
print("Minimum operations:",
minimumChanges(arr, n))
# This code is contributed by ANKITRAI1
// C# program to find minimum
// number of operations required
// to make all array elements zero
class GFG
{
// Function to find minimum number
// of operations required to make
// all array elements zero
static int minimumChanges(int[] arr,
int n)
{
int i;
// It will maintain total
// changes required
int changes = 0;
for (i = 0; i < n; i++)
{
// Check for the first 1
if (arr[i] == 1)
{
int j;
// Check for number of
// consecutive 1's
for(j = i + 1; j < n; j++)
{
if(arr[j] == 0)
break;
}
// Increment i to the position
// of last consecutive 1
i = j - 1;
changes++;
}
}
return changes;
}
// Driver code
static void Main()
{
int[] arr = new int[]{ 1, 1, 0, 0, 0,
1, 0, 1, 1 };
int n = arr.Length ;
System.Console.WriteLine("Minimum operations: " +
minimumChanges(arr, n));
}
}
// This code is contributed by mits
<?php
// PHP program to find minimum number
// of operations required to make all
// array elements zero
// Function to find minimum number
// of operations required to make
// all array elements zero
function minimumChanges($arr, $n)
{
$i;
// It will maintain total
// changes required
$changes = 0;
for ($i = 0; $i < $n; $i++)
{
// Check for the first 1
if ($arr[$i] == 1)
{
$j;
// Check for number of
// consecutive 1's
for($j = $i + 1; $j < $n; $j++)
{
if($arr[$j] == 0)
break;
}
// Increment i to the position
// of last consecutive 1
$i = $j - 1;
$changes++;
}
}
return $changes;
}
// Driver code
$arr = array( 1, 1, 0, 0, 0,
1, 0, 1, 1 );
$n = sizeof($arr);
echo "Minimum operations: " .
minimumChanges($arr, $n);
// This code is contributed
// by Akanksha Rai(Abby_akku)
<script>
// Javascript program to find minimum number of
// operations required to make all
// array elements zero
// Function to find minimum number of
// operations required to make all
// array elements zero
function minimumChanges(arr, n)
{
var i;
// It will maintain total changes required
var changes = 0;
for (i = 0; i < n; i++)
{
// Check for the first 1
if (arr[i] == 1)
{
var j;
// Check for number of
// consecutive 1's
for(j = i+1; j<n; j++)
{
if(arr[j]==0)
break;
}
// Increment i to the position of
// last consecutive 1
i = j-1;
changes++;
}
}
return changes;
}
// Driver code
var arr = [1, 1, 0, 0, 0, 1, 0, 1, 1 ];
var n = arr.length;
document.write( "Minimum operations: " + minimumChanges(arr, n));
</script>
OutputMinimum operations: 3
Complexity Analysis:
- Time Complexity: O(N*N), where N represents the size of the given array.
- Auxiliary Space: O(1), no extra space is required, so it is a constant.
Approach 2:
- As we already know that we have to look for consecutive group/cluster of '1', as after change the first '1' of the group, rest of the consecutive '1's will automatically be changed. So to find the consecutive '1', we can iterate over the array and find the no. of consecutive pair of '1' and '0', as it will indicate the breakpoint for consecutive '1's.
- And at the last index, we will check if the last element of the array is '1' or '0', because, if it is '1', then it is possible that a continuous group of '1' was there and therefore our loop couldn't find the breakpoint as the iteration ended.
Implementation:
C++
// CPP program to find minimum number of
// operations required to make all
// array elements zero
#include <bits/stdc++.h>
using namespace std;
// Function to find minimum number of
// operations required to make all
// array elements zero
int minimumChanges(int arr[], int n)
{
int i;
// It will maintain total changes
// required and return as
// answer
int changes = 0;
// We iterate from 0 to n-1
// We can't iterate from 0 to n as
// the arr[i+1] will be
// out of index
for (i = 0; i < n-1; i++) {
// If we there is a consecutive pair of '1' and
// '0'(in respective order)
if ((arr[i] == 1) && (arr[i + 1] == 0)) {
// We increment our returning variable by 1
changes++;
}
}
// After the loop ends, we check the last element
// whether it is '1'
if (arr[n - 1] == 1) {
changes++;
// If it is '1', we again increment our
// returning variable by 1
}
return changes;
}
// Driver code
int main()
{
int arr[] = { 1, 1, 0, 0, 0, 1, 0, 1, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Minimum operations: "
<< minimumChanges(arr, n);
return 0;
}
// This code is contributed by yashbro
// Java program to find minimum number of
// operations required to make all
// array elements zero
class GFG
{
// Function to find minimum number of
// operations required to make all
// array elements zero
public static int minimumChanges(int arr[], int n)
{
int i;
// It will maintain total changes
// required and return as
// answer
int changes = 0;
// We iterate from 0 to n-1
// We can't iterate from 0 to n as
// the arr[i+1] will be
// out of index
for (i = 0; i < n-1; i++) {
// If we there is a consecutive pair of '1' and
// '0'(in respective order)
if ((arr[i] == 1) && (arr[i + 1] == 0)) {
// We increment our returning variable by 1
changes++;
}
}
// After the loop ends, we check the last element
// whether it is '1'
if (arr[n - 1] == 1) {
changes++;
// If it is '1', we again increment our
// returning variable by 1
}
return changes;
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 1, 1, 0, 0, 0, 1, 0, 1, 1 };
int n = arr.length;
System.out.println( "Minimum operations: "+ minimumChanges(arr, n));
}
}
//This code is contributed by sravan kumar
# Python 3 program to find
# minimum number of operations
# required to make all array
# elements zero
# Function to find minimum number
# of operations required to make
# all array elements zero
def minimumChanges(arr, n):
# It will maintain total
# changes required
changes = 0
# We iterate from 0 to n-1
# We can't iterate from 0 to n as the arr[i+1] will be out of index
for i in range(n - 1):
# If we there is a consecutive pair of '1' and '0'(in respective order)
if arr[i] == 1 and arr[i + 1] == 0:
# We increment our returning variable by 1
changes += 1
# After the loop ends, we check the last element whether it is '1'
if arr[n - 1] == 1:
changes += 1 # If it is '1', we again increment our returning variable by 1
return changes
# Driver code
if __name__ == "__main__":
arr = [1, 1, 0, 0, 0, 1, 0, 1, 1]
n = len(arr)
print("Minimum operations:",
minimumChanges(arr, n))
# This code is contributed by yashbro
// C# program to find minimum number of
// operations required to make all
// array elements zero
using System;
class GFG
{
// Function to find minimum number of
// operations required to make all
// array elements zero
static int minimumChanges(int[] arr, int n)
{
int i;
// It will maintain total changes
// required and return as
// answer
int changes = 0;
// We iterate from 0 to n-1
// We can't iterate from 0 to n as
// the arr[i+1] will be
// out of index
for (i = 0; i < n - 1; i++) {
// If we there is a consecutive pair of '1' and
// '0'(in respective order)
if ((arr[i] == 1) && (arr[i + 1] == 0)) {
// We increment our returning variable by 1
changes++;
}
}
// After the loop ends, we check the last element
// whether it is '1'
if (arr[n - 1] == 1) {
changes++;
// If it is '1', we again increment our
// returning variable by 1
}
return changes;
}
// Driver code
public static int Main()
{
int[] arr = { 1, 1, 0, 0, 0, 1, 0, 1, 1 };
int n = arr.Length;
Console.Write("Minimum operations: "
+ minimumChanges(arr, n));
return 0;
}
}
// This code is contributed by Taranpreet
<script>
// Js program to find minimum number of
// operations required to make all
// array elements zero
// Function to find minimum number of
// operations required to make all
// array elements zero
function minimumChanges( arr, n)
{
let i;
// It will maintain total changes
// required and return as
// answer
let changes = 0;
// We iterate from 0 to n-1
// We can't iterate from 0 to n as
// the arr[i+1] will be
// out of index
for (i = 0; i < n-1; i++) {
// If we there is a consecutive pair of '1' and
// '0'(in respective order)
if ((arr[i] == 1) && (arr[i + 1] == 0)) {
// We increment our returning variable by 1
changes++;
}
}
// After the loop ends, we check the last element
// whether it is '1'
if (arr[n - 1] == 1) {
changes++;
// If it is '1', we again increment our
// returning variable by 1
}
return changes;
}
// Driver code
let arr= [1, 1, 0, 0, 0, 1, 0, 1, 1];
let n =arr.length;
document.write("Minimum operations: "
, minimumChanges(arr, n));
</script>
OutputMinimum operations: 3
Complexity Analysis:
- Time complexity: O(N), where N represents the size of the given array.
- Auxiliary Space: O(1), no extra space is required, so it is a constant.
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