The Chain Transform

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L5

Problem

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.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.