Binary String Reconstruction | Editorial by vibrant

Prerequesite: Math

overview of the problem:- given three number n0, n1,n2 and construct a string which contains only 0's and 1's such that :-
n0 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 0;
n1 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 1;
n2 — the number of such pairs of consecutive characters (substrings) where the number of ones equals 2.

solution:- It can be approached by simple mathematics. ie if the value of n1 is zero then either of n0 or n2 must be zero so only  n0+1 no. of 0's or n2+1 no. of 1's will be printed.
                  if n1 is not zero then we will store the (n1+1)/2 no. of "10" in the array then  we have to check the parity of the n1. if n1 is even  then  just add one more 1's at the end of the array.
                  At last if n0 is not zero then n0 no. of 0's will be added after any 1's in the array and if n2 is not zero then n2 no. of 1 will be added after any 0.

Binary String Reconstruction | Editorial by vibrant

Download submission

All caught up!

View submission

Is your resume even shortlisted?