Skip to content
Related Articles

Related Articles

Improve Article

Number of flips to make binary string alternate | Set 1

  • Difficulty Level : Easy
  • Last Updated : 17 Jun, 2021

Given a binary string, that is it contains only 0s and 1s. We need to make this string a sequence of alternate characters by flipping some of the bits, our goal is to minimize the number of bits to be flipped. 
Examples : 
 

Input : str = “001”
Output : 1
Minimum number of flips required = 1
We can flip 1st bit from 0 to 1 

Input : str = “0001010111”
Output : 2
Minimum number of flips required = 2
We can flip 2nd bit from 0 to 1 and 9th 
bit from 1 to 0 to make alternate 
string “0101010101”.

Expected time complexity : O(n) where n is length of input string.
 

We can solve this problem by considering all possible results, As we are supposed to get alternate string, there are only 2 possibilities, alternate string starting with 0 and alternate string starting with 1. We will try both cases and choose the string which will require minimum number of flips as our final answer. 
Trying a case requires O(n) time in which we will loop over all characters of given string, if current character is expected character according to alternation then we will do nothing otherwise we will increase flip count by 1. After trying strings starting with 0 and starting with 1, we will choose the string with minimum flip count. 
Total time complexity of solution will be O(n) 
 

C++




// C/C++ program to find minimum number of
// flip to make binary string alternate
#include <bits/stdc++.h>
using namespace std;
 
//  Utility method to flip a character
char flip(char ch)
{
    return (ch == '0') ? '1' : '0';
}
 
//  Utility method to get minimum flips when
//  alternate string starts with expected char
int getFlipWithStartingCharcter(string str,
                                char expected)
{
    int flipCount = 0;
    for (int i = 0; i < str.length(); i++)
    {
        //  if current character is not expected,
        // increase flip count
        if (str[i] != expected)
            flipCount++;
 
        //  flip expected character each time
        expected = flip(expected);
    }
    return flipCount;
}
 
// method return minimum flip to make binary
// string alternate
int minFlipToMakeStringAlternate(string str)
{
    //  return minimum of following two
    //  1) flips when alternate string starts with 0
    //  2) flips when alternate string starts with 1
    return min(getFlipWithStartingCharcter(str, '0'),
               getFlipWithStartingCharcter(str, '1'));
}
 
//  Driver code to test above method
int main()
{
    string str = "0001010111";
    cout << minFlipToMakeStringAlternate(str);
    return 0;
}
Java



// Java program to find minimum number of
// flip to make binary string alternate
class GFG
{
    //  Utility method to flip a character
    public static char flip(char ch)
    {
        return (ch == '0') ? '1' : '0';
    }
      
    //  Utility method to get minimum flips when
    //  alternate string starts with expected char
    public static int getFlipWithStartingCharcter(String str,
                                    char expected)
    {
        int flipCount = 0;
        for (int i = 0; i < str.length(); i++)
        {
            //  if current character is not expected,
            // increase flip count
            if (str.charAt(i) != expected)
                flipCount++;
      
            //  flip expected character each time
            expected = flip(expected);
        }
        return flipCount;
    }
      
    // method return minimum flip to make binary
    // string alternate
    public static int minFlipToMakeStringAlternate(String str)
    {
        //  return minimum of following two
        //  1) flips when alternate string starts with 0
        //  2) flips when alternate string starts with 1
        return Math.min(getFlipWithStartingCharcter(str, '0'),
                   getFlipWithStartingCharcter(str, '1'));
    }
      
    //  Driver code to test above method
    public static void main(String args[])
    {
        String str = "0001010111";
        System.out.println(minFlipToMakeStringAlternate(str));
    }
}
 
// This code is contributed by Sumit Ghosh
Python 3



# Python 3 program to find minimum number of
# flip to make binary string alternate
 
# Utility method to flip a character
def flip( ch):
    return '1' if (ch == '0') else '0'
 
# Utility method to get minimum flips when
# alternate string starts with expected char
def getFlipWithStartingCharcter(str, expected):
 
    flipCount = 0
    for i in range(len( str)):
         
        # if current character is not expected,
        # increase flip count
        if (str[i] != expected):
            flipCount += 1
 
        # flip expected character each time
        expected = flip(expected)
    return flipCount
 
# method return minimum flip to make binary
# string alternate
def minFlipToMakeStringAlternate(str):
 
    # return minimum of following two
    # 1) flips when alternate string starts with 0
    # 2) flips when alternate string starts with 1
    return min(getFlipWithStartingCharcter(str, '0'),
            getFlipWithStartingCharcter(str, '1'))
 
# Driver code to test above method
if __name__ == "__main__":
     
    str = "0001010111"
    print(minFlipToMakeStringAlternate(str))
C#



// C# program to find minimum number of
// flip to make binary string alternate
using System;
 
class GFG
{
    // Utility method to
    // flip a character
    public static char flip(char ch)
    {
        return (ch == '0') ? '1' : '0';
    }
     
    // Utility method to get minimum flips
    // when alternate string starts with
    // expected char
    public static int getFlipWithStartingCharcter(String str,
                                                char expected)
    {
        int flipCount = 0;
        for (int i = 0; i < str.Length; i++)
        {
            // if current character is not
            // expected, increase flip count
            if (str[i] != expected)
                flipCount++;
     
            // flip expected character each time
            expected = flip(expected);
        }
        return flipCount;
    }
     
    // method return minimum flip to
    // make binary string alternate
    public static int minFlipToMakeStringAlternate(string str)
    {
        // return minimum of following two
        // 1) flips when alternate string starts with 0
        // 2) flips when alternate string starts with 1
        return Math.Min(getFlipWithStartingCharcter(str, '0'),
                getFlipWithStartingCharcter(str, '1'));
    }
     
    // Driver Code
    public static void Main()
    {
        string str = "0001010111";
        Console.Write(minFlipToMakeStringAlternate(str));
    }
}
 
// This code is contributed by nitin mittal.
PHP



<?php
// PHP program to find minimum number of
// flip to make binary string alternate
 
// Utility method to flip a character
function flip( $ch)
{
    return ($ch == '0') ? '1' : '0';
}
 
// Utility method to get minimum flips when
// alternate string starts with expected char
function getFlipWithStartingCharcter($str,
                                $expected)
{
     
    $flipCount = 0;
    for ($i = 0; $i < strlen($str); $i++)
    {
         
        // if current character is not expected,
        // increase flip count
        if ($str[$i] != $expected)
            $flipCount++;
 
        // flip expected character each time
        $expected = flip($expected);
    }
    return $flipCount;
}
 
// method return minimum flip to make binary
// string alternate
function minFlipToMakeStringAlternate( $str)
{
     
    // return minimum of following two
    // 1) flips when alternate string starts with 0
    // 2) flips when alternate string starts with 1
    return min(getFlipWithStartingCharcter($str, '0'),
               getFlipWithStartingCharcter($str, '1'));
}
 
// Driver code to test above method
$str = "0001010111";
echo minFlipToMakeStringAlternate($str);
 
// This code is contributed by anuj_67.
?>
Javascript



<script>
 
// Javascript program to find minimum number of
// flip to make binary string alternate
     
    //  Utility method to flip a character
    function flip(ch)
    {
        return (ch == '0') ? '1' : '0';
    }
     
    //  Utility method to get minimum flips when
    //  alternate string starts with expected char
    function getFlipWithStartingCharcter(str,expected)
    {
        let flipCount = 0;
        for (let i = 0; i < str.length; i++)
        {
            //  if current character is not expected,
            // increase flip count
            if (str.charAt(i) != expected)
                flipCount++;
        
            //  flip expected character each time
            expected = flip(expected);
        }
        return flipCount;
    }
     
    // method return minimum flip to make binary
    // string alternate
    function minFlipToMakeStringAlternate(str)
    {
         //  return minimum of following two
        //  1) flips when alternate string starts with 0
        //  2) flips when alternate string starts with 1
        return Math.min(getFlipWithStartingCharcter(str, '0'),
                   getFlipWithStartingCharcter(str, '1'));
    }
     
    //  Driver code to test above method
    let str = "0001010111";
    document.write(minFlipToMakeStringAlternate(str));
     
    // This code is contributed by avanitrachhadiya2155
     
</script>
Output : 
2
Minimum number of replacements to make the binary string alternating | Set 2 
 


This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.



My Personal Notes
arrow_drop_up
Previous
Minimum number of replacements to make the binary string alternating | Set 2
Next

Minimum flips required to form given binary string where every flip changes all bits to its right as well
Recommended Articles
Page :
Minimum number of flips with rotation to make binary string alternating
24, Aug 20
Minimum Count of Bit flips required to make a Binary String Palindromic
12, Aug 20
Minimum number of characters to be removed to make a binary string alternate
12, Jan 17
Minimum Group Flips to Make Binary Array Elements Same
23, May 20
Minimize flips required to make all shortest paths from top-left to bottom-right of a binary matrix equal to S
04, Sep 20
Min flips of continuous characters to make all characters same in a string
12, Jul 17
Minimum flips or swapping of adjacent characters required to make a string equal to another
09, Jun 21
Minimum flips to make all 1s in left and 0s in right | Set 2
19, Nov 17
Minimum number of flips or swaps of adjacent characters required to make two strings equal
12, Jul 21
Minimum flips required to keep all 1s together in a Binary string
19, May 20
Minimum flips required in a binary string such that all K-size substring contains 1
24, Jun 20
Minimum flips required to form given binary string where every flip changes all bits to its right as well
14, Jun 20
Minimum non-adjacent pair flips required to remove all 0s from a Binary String
22, Sep 20
Minimum substring flips required to convert given binary string to another
25, Oct 20
Minimum substring flips required to convert a Binary String to another
01, Mar 21
Minimum number of alternate subsequences required to be removed to empty a Binary String
17, Jun 21
Minimum flips to make all 1s in right and 0s in left
16, Nov 20
Rearrange a binary string as alternate x and y occurrences
10, Oct 17
Check if it is possible to rearrange a binary string with alternate 0s and 1s
08, Nov 18
Minimum flips required to convert given string into concatenation of equal substrings of length K
21, Jul 20
Minimize flips required such that string does not any pair of consecutive 0s
03, Feb 21
Minimum bit flips such that every K consecutive bits contain at least one set bit
11, Jun 20
Count minimum right flips to set all values in an array
14, Jun 17
Minimum number of replacements to make the binary string alternating | Set 2
05, Mar 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox