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 minimum number of single-letter changes to transform start into end, where every intermediate word must also be in the dictionary. Return the number of words in the shortest transformation sequence (including start and end). Return 0 if no 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