Easy One!

CodeChefOpen on judge ↗

Gourav was preparing for Codechef certification exam and while preparing for the exam he came across a problem which he was not able solve after lots of effort. So he needs your help to solve this problem.Problem was like you are given language that contains only 64 character numbered 0-63. * Characters from ‘A’-’Z’ numbered 0-25 * Characters from ‘a’-’z’ numbered 26-51 * Digits from ‘0’-’9’ numb

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