{"push_id":663529519,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7c15eb4721f163e3b89f6fb375a79508e1d8695d","before":"aa50705ba96468ca2269fd49169f83ca50625c4b","commits":[{"sha":"7c15eb4721f163e3b89f6fb375a79508e1d8695d","author":{"email":"38c61316fcce1a15ff28b55820e32b838e76a2c8@users.noreply.github.com","name":"maxkahn"},"message":"Create wordchains\n\nThis is problem 82 on 4clojure. Given a set of words, this function returns true if they can be arranged into a word chain, false otherwise.\r\n\r\nWe first define a function wordpair, which tests whether two words can be adjacent in a word chain. Then we build longer and longer word chains by concatenating existing chains (making sure not to double back). If this process terminates (ie if result and storage are equal) and none of these chains are as long as the original set, then we return false. If we do have a long enough chain, then we return true.","distinct":true,"url":"https://api.github.com/repos/maxkahn/clojure-problems/commits/7c15eb4721f163e3b89f6fb375a79508e1d8695d"}]}