Three-Way String Split with Equal Ones - Microsoft Top Interview Questions


Problem Statement :


You are given a binary string s containing "1"s and "0"s. 

Return the number of ways to split the string into three non-empty parts a, b and c such that a + b + c = s and the number of "1"s in each string is the same. Mod the result by 10 ** 9 + 7.

Constraints

3 < n ≤ 100,000 where n is the length of s

Example 1

Input

s = "11001111"

Output

3

Explanation

We can have



"11" + "0011" + "11"

"110" + "011" + "11"

"1100" + "11" + "11"


Solution :



title-img 




                        Solution in C++ :

#define all(a) begin(a), end(a)
using ll = long long;
const int M = 1e9 + 7;

int solve(string s) {
    const int n = (int)s.length();
    int z = count_if(all(s), [](auto c) { return c == '1'; });  // 1st pass
    if (!z) return ((ll)(n - 2) * (n - 1) / 2) % M;
    if (z % 3) return 0;
    z /= 3;
    int k = 0;
    int a, b, c, d;
    for (int i = 0; i < n; ++i) {  // 2nd pass
        if (s[i] == '0') continue;
        ++k;
        if (k == z) a = i;
        if (k == z + 1) b = i;
        if (k == 2 * z) c = i;
        if (k == 2 * z + 1) {
            d = i;
            break;
        }
    }
    return (ll)((b - a) * (d - c)) % M;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    long mod = (long) (1e9 + 7);
    int corner_case(int n) {
        long res = 0;
        for (int i = 1; i <= n - 2; i++) res += n - i - 1;
        return (int) (res % mod);
    }
    public int solve(String s) {
        int total_ones = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '1')
                total_ones++;
        }

        int one_third = 0;
        int two_third = 0;
        int one_count = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '1')
                one_count++;
            if (one_count == total_ones / 3)
                one_third++;
            if (one_count == 2 * total_ones / 3)
                two_third++;
        }

        if (one_count == 0)
            return corner_case(s.length());
        if (one_count % 3 != 0)
            return 0;
        long res = one_third * two_third;
        return (int) (res % mod);
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, s):
        if not s:
            return 1
        Mod = 1000000007
        o = s.count("1")
        if o:
            if o % 3:
                return 0
            i = 0
            o //= 3
            c = 0
            while c < o:
                c += s[i] == "1"
                i += 1
            j = i
            o *= 2
            while c < o:
                c += s[j] == "1"
                j += 1
            x, y = 0, 0
            while s[i] == "0":
                x += 1
                i += 1
            while s[j] == "0":
                y += 1
                j += 1
            return (x + 1) * (y + 1) % Mod
        else:
            n = len(s)
            if n < 3:
                return 0
            return (n - 1) * (n - 2) // 2 % Mod


View More Similar Problems

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →

Largest Rectangle

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle

View Solution →

Simple Text Editor

In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,

View Solution →

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →