Codeforces Round-558 Problem-D(Help)

Revision en1, by aditya123garg, 2019-05-10 15:06:08

Hey Guys!! I have been trying to understand the Editorial's solution from quite a while now but couldn't get it properly. Can anyone please throw some light on how to proceed it.

Question link :-

What I have understood till now.

At every position, we will assume every possible character to be there in the string c whenever there is asterisk present and after that, we are also maintaining what is the length of the prefix of string t and s which matches with the suffix of string c[0, i]. Now, how to move beyond this?

Additional help :-

Can someone provide some similar questions to this one which they have encountered while practicing.

Tags aditya123garg, round-558, #problem d


  Rev. Lang. By When Δ Comment
en1 English aditya123garg 2019-05-10 15:06:08 751 Initial revision (published)