← All problemsSign in

Mystery Secret Code

Problem description. Solve the Mystery. See the sample test cases for hints. Input Input description. The first line contains an integer t denoting the number of test cases. It is followed by t lines of input, each containing the string whose secret code is to be calculated. Output Output description. For each test case print the secret code of the given string. Constraints 0 Example In

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

Sign in to chat with the tutor and save your progress.

Sign in to start