Daily Coding Problem: Problem #1014 [Medium]

											Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given a start word, an end word, and a dictionary of valid words, find the shortest transformation sequence from start to end such that
only one letter is changed at each step of the sequence, and each transformed word exists in the dictionary. If there is no possible transformation,
return null. Each word in the dictionary have the same length as start and end and is lowercase.
For example, given start = "dog", end = "cat", and dictionary = {"dot", "dop", "dat", "cat"}, return ["dog", "dot", "dat", "cat"].
Given start = "dog", end = "cat", and dictionary = {"dot", "tod", "dat", "dar"}, return null as there is no possible transformation from dog to cat.

Upgrade to premium and get in-depth solutions to every problem, including this one. Since you were referred by one of our affiliates, you'll get a 10% discount on checkout!
If you liked this problem, feel free to forward it along so they can subscribe here! As always, shoot us an email if there's anything we can help with!

Practice makes perfect. Book a mock interview with a FAANG-level interviewer today from our friends at Exponent (10% off!).
System design interviews are becoming more popular in SWE interviews. Here's how to prepare.

  No more? Snooze or unsubscribe.

Daily Coding Problem: Problem #1014 [Medium]

Key phrases

Older messages