← Amazon questions

String Navigation via Dictionary Words

Filed under Amazon

Given two strings and a dictionary of words, find the shortest transformation sequence from the start string to the end string, changing one character at a time, where every intermediate word exists…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.