Problem
Given start and end words (lowercase, same length ≤ 6) and a dictionary (up to 10 words), return the minimum number of steps to transform start to end by changing one letter at a time, each intermediate word must be in the dictionary (or -1 if impossible).
Input format
Input
input.txt
- start word - end word - integer N (number of dictionary words) - N lines: dictionary words
Output format
Output
output.txt
- Minimum number of steps (including start and end), or -1
Example
input
hit cog 5 hot dot dog lot log
output
5
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
hit cog 5 hot dot dog lot log
Expected output
5
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc