Notes on Snarky Hangman - Sec 01

Read in huge file of words (but really small file for testing)

user types in length of words to consider

replace list with words of that length

User types in first letter: t

create a dictionary of categories of 
  - words without that letter
  - words with that letter in same place (several categories)

write a function pass it a letter, list of words, length of word
  - could return a dictionary (build it)
  - or return the new list (biggest category in the dictionary)

get the new list based on the largest category

Play another round 
User guesses another letter: a

build another dictionary this time pass the letter a
(note you are using the list from that was passed back before
and already considered t - so either t is not in any word in the list or t is in the same place in every word in the list)

categories - pick the largest category in your dictionary - use
that list going forward

useful function - given a word and a letter return a string with the letter in the correct location and all other spots _

   f("oboe", "o") returns  "o_o_"  

  "o_o_" is a key for the dictionary

   The value is a list of words that fit it. 
    d["o_o_"] = ['oboe', 'odor']


Use the biggest category - have considered both t and o