Subsequence Hate | Editorial by Dipali

Subsequence Hate | Editorial by Dipali_Kumbhar

In order to avoid formation of substrings "101" and "010" -
Count the number of flips required to make the string with conditions-

1. All 1's to left side.
2. All 1's to right side.
And finally print minimum count.
Code:

```

/* Author : Dipali Kumbhar  */
#include<bits/stdc++.h>
using namespace std;

//define macros
#define ll long long
#define pb push_back
#define endl "\n"
#define vll vector<ll>

//Fast input-output methods in c++
void fastio()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

int main()
{

fastio();
    ll t;
    cin>>t;                  //Number of test cases
    while(t--)
    {
        string str;         
        cin>>str;
        ll n=str.length();      //Length of the string

//Storing char of strings in a vector of long long
        vll v;
        for(ll i=0;i<n;i++)
        {
            v.pb(str[i]-48);    
        }

//All 1's to left side
        vll vb(n,0);
        ll cnt=INT_MAX;
        for(ll i=0;i<=n;i++)
        {
            if(i>0)
                vb[i-1]=1;
            ll temp=0;
            for(ll j=0;j<n;j++)
            {
                if(vb[j] != v[j])   
                    temp++;
            }
            if(cnt>temp )
                cnt=temp;
        }

//All 1's to right side
        ll cnt1=INT_MAX;
        vll vb1(n,0);
        for(ll i=n-1;i>=0;i--)
        {
            vb1[i]=1;
            ll temp=0;
            for(ll j=0;j<n;j++)
            {
                if(vb1[j] != v[j])
                    temp++;
            }
            if(cnt1>temp )
                cnt1=temp;
        }

//print the minimum count
        cout<<min(cnt,cnt1)<<endl;
    }

return 0;
}
```

Subsequence Hate | Editorial by Dipali_Kumbhar

Download submission

All caught up!

View submission

Is your resume even shortlisted?