Interview Question for Software Engineer at Amazon.com:

Hard question: Given a game where you start with a word (for example, "TAGS"), find an algorithm that will give you the shortest number of intermediary words to get to a final word (for example, "LAYS"). So in the example above, a possible sequence would be, TAGS, SAGS, SASS, LASS, LAYS.