Minimum Subarray reversals to sort given Binary Array Last Updated : 28 Jul, 2022 Summarize Comments Improve Suggest changes Share Like Article Like Report Given a binary array A[] of size N, the task is to find the minimum number of subarrays that need to be reversed to sort the binary array. Examples: Input: N = 4, A[]: {1, 0 , 0, 1} Output: 1Explanation: Reverse the array from 0 to 2 to change the array to {0, 0, 1, 1} Input: N = 4, A[]: {1, 0, 1 , 0}Output: 2Explanation: Reverse the array from 1 to 2 and then from 0 to 3 Approach: The idea to solve the problem is as follows: To sort A[] iterate through the array and reverse every leftmost instance of a subarray of A[] with consecutive '1's and then consecutive '0's. The count of all these subarrays can be found by counting the indices where A[i] = 1 and the next element i.e., A[i+1] = 0. Follow the steps below to implement the idea: Initialize a count variable with 0. Run a loop from 0 to N-2, and in each iteration do the following:If the ith element is 1 and (i+1)th element is 0 increment count by one as there is a subarray of the type [. . .1100. . . ] that needs to be reversed to sort the array.Return the count variable. Below is the implementation of the above approach. C++ // C++ Code to Implement the approach #include <bits/stdc++.h> using namespace std; // Function to count the minimum number of reversals int minOperations(int n, int A[]) { // Declare variable to count the operations int count = 0; for (int i = 0; i < n - 1; i++) { // Whenever there is a pattern of // consecutive 1's followed by 0's // It means you have to reverse that // subarray, so increase your count by 1 if (A[i] == 1 && A[i + 1] == 0) { count++; } } // Return the count return count; } // Driver Code int main() { int A[] = { 1, 0, 1, 0 }; int N = sizeof(A) / sizeof(A[0]); // Function Call cout << minOperations(N, A); return 0; } Java // Java Code to Implement the approach public class GFG { // Function to count the minimum number of reversals static int minOperations(int n, int A[]) { // Declare variable to count the operations int count = 0; for (int i = 0; i < n - 1; i++) { // Whenever there is a pattern of // consecutive 1's followed by 0's // It means you have to reverse that // subarray, so increase your count by 1 if (A[i] == 1 && A[i + 1] == 0) { count++; } } // Return the count return count; } // Driver Code public static void main (String[] args) { int A[] = { 1, 0, 1, 0 }; int N = A.length; // Function Call System.out.println(minOperations(N, A)); } } // This code is contributed by AnkThon Python3 # Python3 Code to Implement the approach # Function to count the minimum number of reversals def minOperations(n, A) : # Declare variable to count the operations count = 0; for i in range(n-1) : # Whenever there is a pattern of # consecutive 1's followed by 0's # It means you have to reverse that # subarray, so increase your count by 1 if (A[i] == 1 and A[i + 1] == 0) : count += 1; # Return the count return count; # Driver Code if __name__ == "__main__" : A = [ 1, 0, 1, 0 ]; N = len(A); # Function Call print(minOperations(N, A)); # This code is contributed by AnkThon C# // C# Code to Implement the approach using System; public class GFG { // Function to count the minimum number of reversals static int minOperations(int n, int []A) { // Declare variable to count the operations int count = 0; for (int i = 0; i < n - 1; i++) { // Whenever there is a pattern of // consecutive 1's followed by 0's // It means you have to reverse that // subarray, so increase your count by 1 if (A[i] == 1 && A[i + 1] == 0) { count++; } } // Return the count return count; } // Driver Code public static void Main (string[] args) { int []A = { 1, 0, 1, 0 }; int N = A.Length; // Function Call Console.WriteLine(minOperations(N, A)); } } // This code is contributed by AnkThon JavaScript <script> // JavaScript Code to Implement the approach // Function to count the minimum number of reversals const minOperations = (n, A) => { // Declare variable to count the operations let count = 0; for (let i = 0; i < n - 1; i++) { // Whenever there is a pattern of // consecutive 1's followed by 0's // It means you have to reverse that // subarray, so increase your count by 1 if (A[i] == 1 && A[i + 1] == 0) { count++; } } // Return the count return count; } // Driver Code let A = [1, 0, 1, 0]; let N = A.length // Function Call document.write(minOperations(N, A)); // This code is contributed by rakeshsahni </script> Output2 Time Complexity: O(N)Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Minimum Subarray reversals to sort given Binary Array M meswatisingh630 Follow Improve Article Tags : C/C++ Puzzles Advanced Data Structure DSA Practice Tags : Advanced Data Structure 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 14 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 4 min read Sorting Algorithms A 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 Like