Dummy program that takes a string of characters (e.g. str == "asdeqwdrfesatgha") and natural number n (1 <= n <= length str) and finds all words made from characters from str with length n (checks in a dictionary if the current string with length n is a word). Made it to help a friend cheat in a Android app called "Scrabble" or whatever. Written in Haskell.
Be the first to post a review of dumbowords!