Codechef Password Recovery
Chef recently decided a very curious encryption algorithm for CodeChef passwords. He took an N-letter password and found all the possible 2-letter substrings, considering the characters of a password was written in a circle. Thus, for AbcD, he would deduce the following substrings: Ab, bc, cD, DA. Then, some of the substrings were reversed. For example, the set of substrings above could be conver
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.
Sign in to chat with the tutor and save your progress.
Sign in to start