Skip to main content
hardNeetCode 150

Word Ladder

Transform one word into another, changing one letter at a time, using only valid dictionary words. It's a shortest-path problem hiding behind a word puzzle—BFS finds the minimum steps. The insight is modeling words as graph nodes where edges connect words that differ by exactly one letter.

Arrays & HashingStringGraphsBFS / DFS

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Shortest Transformationhard
Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.