Word Ladder at Amazon

Hard44.9% acceptance

This problem has 75.0% frequency at Amazon.

Problem Description

A **transformation sequence** from word `beginWord` to word `endWord` using a dictionary `wordList` is a sequence of words `beginWord -> s1 -> s2 -> ... -> sk` such that: * Every adjacent pair of words differs by a single letter. * Every `si` for `1 <= i <= k` is in `wordList`. Note that `begin...

Read full problem and hints

Topics

Also asked at 36 companies


More Amazon Questions

View all Amazon questions