#82
Word Chains
 

Difficulty:Hard
Topics:seqs


A word chain consists of a set of words ordered so that each word differs by only one letter from the words directly before and after it. The one letter difference can be either an insertion, a deletion, or a substitution. Here is an example word chain:

cat -> cot -> coat -> oat -> hat -> hot -> hog -> dog

Write a function which takes a sequence of words, and returns true if they can be arranged into one continous word chain, and false if they cannot.
test not run
(= true (__ #{"hat" "coat" "dog" "cat" "oat" "cot" "hot" "hog"}))
test not run
(= false (__ #{"cot" "hot" "bat" "fat"}))
test not run
(= false (__ #{"to" "top" "stop" "tops" "toss"}))
test not run
(= true (__ #{"spout" "do" "pot" "pout" "spot" "dot"}))
test not run
(= true (__ #{"share" "hares" "shares" "hare" "are"}))
test not run
(= false (__ #{"share" "hares" "hare" "are"}))


Code which fills in the blank: