Dancing Words
CodeChefOpen on judge ↗
In the “Dancing Words” problem, we are concerned with words constructed using the lowercase letters of the English alphabet - that is, a,b,c,...,z. These words need not necessarily be meaningful, any sequence of letters forms a word. For example, abbcada is a word. We say that we can "hop" from the word word1 to the word word2 if they are "sufficiently close". We define word2 to be su
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