Reach Codetown

CodeChefRating 1022Open on judge ↗

Chef embarks on a journey starting from a town named $S$, containing a string of $8$ **uppercase** English alphabets. His objective is to reach the destination known as `CODETOWN`. If Chef is currently in town $T_1$, then, with each move, Chef can transition to another town named $T_2$, provided that **either**: - $T_2$ is derived from $T_1$ by replacing a consonant with another consonant, or; -

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