Whiteboard Algorithm Function | Dataford Interview Questions

Write a function to solve a standard algorithmic challenge on the whiteboard.

Implement find_ladders(beginWord, endWord, wordList) to return every shortest transformation sequence from beginWord to endWord, changing exactly one character at each step and using only words in wordList. Return an empty list when no sequence exists. Each input word has the same length, and the output must contain complete paths.

Constraints

1 <= beginWord.length == endWord.length <= 10
1 <= wordList.length <= 5000
All words contain lowercase English letters
All words have the same length
Each returned sequence must use one-character transformations
Return every sequence with the minimum number of words

Function Signature

def find_ladders(beginWord, endWord, wordList):

Your question is Whiteboard Algorithm Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a function to solve a standard algorithmic challenge on the whiteboard.

Constraints

1 <= beginWord.length == endWord.length <= 10
1 <= wordList.length <= 5000
All words contain lowercase English letters
All words have the same length
Each returned sequence must use one-character transformations
Return every sequence with the minimum number of words

Function Signature

def find_ladders(beginWord, endWord, wordList):

Your question is Whiteboard Algorithm Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.