Sweet by Chef

CodeChefOpen on judge ↗

Chef has prepared a new Sweet and is thinking of a name for it. His wife suggests him a name $S$ for the dish but the suggested name contains some of the sweets name which chef doesn't likes. Chef doesn't likes $N$ sweets in total given as $B_1 , B_2 , .... , B_N$. To get final name of the sweet he does the following: - Searches $S$ for occurrence of any of the $B_i$. - Deletes the first occurrenc

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI