Tina and Thesaurus

CodeChefOpen on judge ↗

Tina is expert in English language and she also written her own Thesaurus. One fine day her English teacher Raghu decided to test her skills and conducted an exam. In that exam Tina is given a string and a set of strings(collection of strings from her Thesaurus). She has to find the longest string in the set of strings that can be formed by popping some of the characters from the string. In case

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