HackerRank Beautiful Binary String Solution

Hello Programmers, In this post, you will learn how to solve HackerRank Beautiful Binary String Solution. This problem is a part of the HackerRank Algorithms Series.

One more thing to add, don’t straight away look for the solutions, first try to solve the problems by yourself. If you find any difficulty after trying several times, then look for the solutions. We are going to solve the HackerRank Algorithms problems using C, CPP, JAVA, PYTHON, JavaScript & SCALA Programming Languages.

You can practice and submit all HackerRank problem solutions in one place. Find a solution for other domains and Sub-domain. I.e. Hacker Rank solution for HackerRank C ProgrammingHackerRank C++ ProgrammingHackerRank Java Programming, HackerRank Python ProgrammingHackerRank Linux ShellHackerRank SQL Programming, and HackerRank 10 days of Javascript.

Beautiful Binary String problem solution
Beautiful Binary String problem solution

As you already know that this site does not contain only the Hacker Rank solutions here, you can also find the solution for other problems. I.e. Web Technology, Data StructuresRDBMS ProgramsJava Programs Solutions,  Fiverr Skills Test answersGoogle Course AnswersLinkedin Assessment, and Coursera Quiz Answers.

HackerRank Beautiful Binary String


Alice has a binary string. She thinks a binary string is beautiful if and only if it doesn’t contain the substring ”010”.

In one step, Alice can change a 0 to a 1 or vice versa. Count and print the minimum number of steps needed to make Alice see the string as beautiful.


b = 010

She can change any one element and have a beautiful string.

Function Description

Complete the beautifulBinaryString function in the editor below.

beautifulBinaryString has the following parameter(s):

  • string b: a string of binary digits


  • int: the minimum moves required

Input Format

The first line contains an integer n, the length of binary string.
The second line contains a single binary string b.


  • 1 <= n <= 100
  • b[i] ∈ {0, 1}

Output Format

Print the minimum number of steps needed to make the string beautiful.

Sample Input 0

STDIN Function
—– ——–
7 length of string n = 7
0101010 b = ‘0101010

Sample Output 0


Explanation 0:

In this sample, b = “0101010”

The figure below shows a way to get rid of each instance of “010”:

Make the string beautiful by changing 2 characters (b[2] and b[5]).

Sample Input 1


Sample Output 1

Explanation 1

The substring “010” does not occur in b, so the string is already beautiful in 0 moves.

Sample Input 2


Sample Output 2


Explanation 2

In this sample b = “0100101010”

One solution is to change the values of b[2], b[5], and b[9] to form a beautiful string.

HackerRank Beautiful Binary String Solution

Beautiful Binary String Solution in C

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    int n; 
    char* B = (char *)malloc(10240 * sizeof(char));
    int i=0,count=0;
    return 0;

Beautiful Binary String Solution in Cpp

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

char B[105];

int main(){
    int n;
    int ans=0;
    scanf("%d", &n);
    scanf("%s", B);
    for(int i=2; B[i]; i++){
        if(B[i-2] == '0' && B[i-1] == '1' && B[i] == '0') B[i] = '1', ans++;
    printf("%d", ans);
    return 0;

Beautiful Binary String Solution in Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String B = in.next();
        int i = 0;
        int total = 0;
        while (i < B.length()-2) {
            if (B.substring(i,i+3).equals("010")) {
            } else {

Beautiful Binary String Solution in Python


import sys

n = int(raw_input().strip())
B = raw_input().strip()

if '010' not in B:
    print 0
    print B.count('010')

Beautiful Binary String Solution using JavaScript


var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");

function readLine() {
    return input_stdin_array[input_currentline++];

/////////////// ignore above this line ////////////////////

function main() {
    var n = parseInt(readLine());
    var B = readLine();


Beautiful Binary String Solution in Scala

object Solution {

  def main(args: Array[String]): Unit = {
    val initTime = System.currentTimeMillis()

    val n = lines.next().toInt
    val binString = lines.next()
    var p1 = 0
    val l = binString.length

    if(binString.length < 2) {
    } else {
      var count = 0
      while(p1 < l-2) {
        if(binString(p1) == '0' && binString(p1+1) == '1' && binString(p1+2) == '0') {
          count += 1
          p1 += 3
        } else {
          p1 += 1

    printTime(initTime, System.currentTimeMillis())

  private val file = new java.io.File("C:\\Users\\User\\Desktop\\hackerrank\\input_competition.txt")
  private val lines = {
    if(file.exists()) {
    } else {
  private val out = new java.io.PrintWriter(System.out)
  private def printTime(init: Long, end:Long):Unit =
    if(file.exists()) out.println(s"${end-init} ms")

Beautiful Binary String Solution in Pascal

uses math;
var   s:ansistring; i,n,ans:longint;

 for i:=2 to n-1 do
 if (s[i]='1')  and (s[i-1]='0' ) and (s[i+1]='0' ) then

Disclaimer: This problem (Beautiful Binary String) is generated by HackerRank but the solution is provided by Chase2learn. This tutorial is only for Educational and Learning purposes.


1. How do you solve the first question in HackerRank?

If you want to solve the first question of Hackerrank then you have to decide which programing language you want to practice i.e C programming, Cpp Programing, or Java programming then you have to start with the first program HELLO WORLD.

2. How do I find my HackerRank ID?

You will receive an email from HackerRank to confirm your access to the ID. Once you have confirmed your email, the entry will show up as verified on the settings page. You will also have an option to “Make primary”. Click on that option. Read more

3. Does HackerRank detect cheating?

yes, HackerRank uses a powerful tool to detect plagiarism in the candidates’ submitted code. The Test report of a candidate highlights any plagiarized portions in the submitted code and helps evaluators to verify the integrity of answers provided in the Test.

4. Does HackerRank use camera?

No for coding practice Hackerrank does not use camera but for companies’ interviews code submission time Hackerrank uses the camera.

5. Should I put HackerRank certificate on resume?

These certificates are useless, and you should not put them on your resume. The experience you gained from getting them is not useless. Use it to build a portfolio, and link to it on your resume. 

6. Can I retake HackerRank test?

The company which sent you the HackerRank Test invite owns your Test submissions and results. It’s their discretion to permit a reattempt for a particular Test. If you wish to retake the test, we recommend that you contact the concerned recruiter who invited you to the Test and request a re-invite. 

7. What is HackerRank?

HackerRank is a tech company that focuses on competitive programming challenges for both consumers and businesses. Developers compete by writing programs according to provided specifications. Wikipedi

Finally, we are now, in the end, I just want to conclude some important message for you

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.

Please share our posts on social media platforms and also suggest to your friends to Join Our Groups. Don’t forget to subscribe. 

Sharing Is Caring

Leave a Comment