Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Graph problems

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Graph problems

Word Ladder

advancedlayer I5 · Graph problems5 tests

Given beginWord, endWord and a list of words wordList, return the number of words in the shortest transformation sequence from beginWord to endWord.

  • Each step changes exactly one letter
  • Every intermediate word — and endWord — must appear in wordList
  • beginWord does not need to be in the list
  • The count includes both ends: hit -> hot -> dot -> dog -> cog is 5
  • If no sequence exists, return 0. All words have the same length and use lowercase letters

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen