Parallel Universe

CodeChefOpen on judge ↗

You are given a string S consisting of uppercase English letters (A–Z). Each character is transformed using a bit-reversal operation on its index: 1. Convert the character to its position (0-based index): A → 0, B → 1, ..., Z → 25 2. Convert this number to binary (without leading zeros) 3. Reverse the binary representation 4. Convert the reversed binary back to decimal 5. Take modulo 26 o

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