CakeWalk

CodeChefOpen on judge ↗

Given a string containing only lower case letters ,print first occurrence of all the letters present in that order only. ###Input: The first line will contain an integer $T$ denoting the total number of Testcases. Then the test cases follow. Each test case contains a single line of input, containing a string $S$. ###Output : Desired Output ###Constraint : |$S$|<=200 ###Samp

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