Given a list of English words and a set of letters (say “yxmijcmknbshdwifzrsmueist”), display all the words that can possibly be constructed from any subset (or all) those letters.
Assume the goal is to minimize the time between receiving the letters and displaying the possible words.
- Your algorithm should work with letter strings of arbitrary length. Try testing it with strings of 100 or 200 letters to see if it can scale.
- Consider the case where input string is short (let's say <16 letters)?