Fanatics | Senior Backend Engineer | Coding | Phone Screen

Given a list of words, a starting word, and an ending word, determine if there is a path of words in the list which navigates from the starting word to the ending word. A "path" between starting and ending word exists if the last letter of the first word is the same as the first letter of the next word. If a path exists, print out the path. If a path does not exist, print "No path exists." // [dog, grin, rad, gum, na...