title: Algorithm to get a list of all words that are anagrams of all substrings (scrabble)?
body: <p>Eg if input string is helloworld I want the output to be like:</p>
  
  <pre><code>do
  he
  we
  low
  hell
  hold
  roll
  well
  word
  hello
  lower
  world
  ...
  </code></pre>
  
  <p>all the way up to the longest word that is an anagram of a substring of helloworld. Like in Scrabble for example.
  The input string can be any length, but rarely more than 16 chars.</p>
  
  <p>I've done a search and come up with structures like a trie, but I am still unsure of how to actually do this.</p>