Cisco | OA | SDE1 | Coding Questions and Solutions | INDIA | April 2023

Question

Answer 1

int countBinarySubstring(string s){
    int n = s.size();
    vector<int> last = {1};
    char c = s[0];
    for(int i=1;i<n;i++){
        if(s[i] == c){
            last.back()++;
        }else{
            c = s[i];
            last.push_back(1);
        }
    }
    int ans = 0;
    for(int i=1;i<last.size();i++){
        ans = max(ans,2*min(last[i],last[i-1]));
    }
    return ans;
}

Answer 2

#include <bits/stdc++.h>
using namespace std;
#define int long long

int32_t main() {
    string str;
    cin>>str;
    vector<int>vec;
    int i=0;
    int n=str.size();
    while(i<n){
        int j=i;
        while(str[i]==str[j])
        j++;
        vec.push_back(j-i);
        i=j;
    }
    int sum=0;
    for(int i=0;i<vec.size()-1;i++)
    sum+=min(vec[i],vec[i+1]);
    cout<<sum<<endl;
    return 0;
}