Given beginWord, endWord, and a wordList, find the length of the shortest transformation sequence where each step changes exactly one letter.
Input: beginWord='hit', endWord='cog', wordList=['hot','dot','dog','lot','log','cog'] Output: 5 (hit→hot→dot→dog→cog)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features