In this video I have tried to explain the intution and code of problem A,B,C and D.
problem A: simple , constructive problem
problem B: try to make all value of arr less than equal to k;
problem C:- Try to compress the range L and R so that string has same changes. and count diffrent {l,r}.
problem D: merge all subarray which does not contain 0 and convert it to single element and generate new array .
codeforces handle:- https://codeforces.com/profile/manitianajay45
linkedin:- https://www.linkedin.com/in/ajay-bhakar-7a14451a2/
#codeforces #cp #codeforces152 #manitianajay45 #educational #educational152 #MorningSandwitch #Monsters #BinaryStringCopying #ArrayPainting
