×

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

 0 Immortal Frieza Problem Code: FRIEZA asked 13 Jun, 18:59 1 accept rate: 0%

 0 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. answered 13 Jun, 19:13 58●3 accept rate: 33%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×612