can anyone explain me the problem of Immortal Frieza Problem Code: FRIEZA

problem

#1

Immortal Frieza Problem Code: FRIEZA


#2

Yeah sure, you are given a string “frieza”(let it be called f)
and each input will consist of a string(lets assume it to be S). So now what you have to do is count continous presence or non presence of character from string f in S.

What I mean is let’s assume string S be"terdazhh"

So initially we have character t(not present in f) so we print 1, then we have “er” which are present so print2. Then there is d so once more 1. Then we have az so it’s two then there is hh so final print will be 2.
If you have any doubt ask.