Take n-length array with n-length words in it to find longest word that can
chain to a 3 letter word (in the array) by taking out any one letter and
becoming an anagram for a shorter word in the array.
f**********t 发帖数: 1001
2
Take n-length array with n-length words in it to find longest word that can
chain to a 3 letter word (in the array) by taking out any one letter and
becoming an anagram for a shorter word in the array.
