Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 126. Word Ladder II
Find all shortest sequences transforming beginWord to endWord by changing one letter at a time using only words from wordList; treat words as nodes in an unweighted graph (edges connect one-letter differences), use BFS to discover shortest distances/level graph and then backtrack/DFS to enumerate all shortest transformation paths.
Asked at:
Meta
Bloomberg
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid November, 2025
Meta
Senior
Mid August, 2025
Bloomberg
Senior
Mid July, 2025
Bloomberg
Senior
Optimal TC not required, just a working solution was needed
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.