The Chain Transform
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L5
Interview Prompt
Given a start word, an end word, and a dictionary of words, compute the length of the shortest transformation sequence that changes the start word into the end word, where each step changes exactly one letter and every intermediate word must appear in the dictionary. Return the number of words in that shortest sequence, counting BOTH the start and end words (for example, hit -> hot -> dot -> dog -> cog has length 5). Return 0 if no such transformation exists.
Summary
One small step at a time can cover a great distance.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision