Comments

Sir can you explain In problem D why we will count no of submasks present in an array.Basically I didn't understand the getmaxlength() function

Problem B can also be solved by dp. My submission https://mirror.codeforces.com/contest/1937/submission/24898172.First we create most optimal string and then apply dp for how many ways we can create this string.(Basically number of paths).

https://mirror.codeforces.com/contest/1917/submission/238696258 Can anyone tell why my sol gives wrong answer

Still I didn't understand it

Can anyone explain the concept behind problem D.I didnt understand the editorial

can anyone give the implementation of problem "D".It will be really helpful.