title: Find 5 letter words with 25 distinct characters
body: <p>Solving <a href="https://www.powerlanguage.co.uk/wordle/" rel="noreferrer">wordle</a> efficiently (for humans and for computers) is all the rage right now.</p>
  <p>One particular way of solving a wordle made me curious. The idea is to select 5 words that have distinct letters so you'll end up with 25 characters. If you use these 5 words as your first 5 guesses in the game, you'll have a close to 100% chance of getting the correct word in your last guess (it's essentially an anagram of all the clues and you'll probably have a few green ones). There is a set of words that is suggested (all of the words are valid English words):</p>
  <ul>
  <li>brick</li>
  <li>glent</li>
  <li>jumpy</li>
  <li>vozhd</li>
  <li>waqfs</li>
  </ul>
  <p>But this made me wonder: How many of these 5 word combinations are out there and I started whipping up a recursive algorithm but I am close to giving up.</p>
  <p>My initial thought was:</p>
  <ul>
  <li>Start with the first word</li>
  <li>reduce overlapping words from the word list</li>
  <li>pick the next remaining word in the word list</li>
  <li>Repeat with the next word</li>
  </ul>
  <p>But this only really works if you have a set of five distinct words in order.</p>
  <p>For this list:</p>
  <ul>
  <li>brick</li>
  <li>feast</li>
  <li>glent</li>
  <li>jumpy</li>
  <li>vozhd</li>
  <li>waqfs</li>
  </ul>
  <p>I will end up with: <code>[brick, feast, jumpy, vozhd]</code> because <code>feast</code> comes before <code>glent</code> and will filter it out but in the end <code>glent</code> would have been the better pick.</p>
  <p>I wasn't able to find any algorithms for this specific problem so I was wondering if there is any existing algorithm that can be applied to this?</p>