Look for anagrams from a set of single words that is fetched from an text file.
Latest commit dbfbdc6 Jul 3, 2012 @joneslee85 Refactor
Failed to load latest commit information.
README.md Drop rspec in favor of minitest Jul 3, 2012
anagram.rb Refactor Jul 4, 2012
run.rb Refactor Jul 4, 2012
spec.rb Refactor Jul 4, 2012
wordlist.txt Initial commit Sep 6, 2011


Anagram Solver

Given a file containing one word per line, print out all the combinations of words that are anagrams; each line in the output should contain a set of input words that are anagrams of each other. No word should appear in the output more than once.

For added programming pleasure, find the longest words that are anagrams, and the set of anagrams containing the most words.

The app is tested with Ruby 1.9.3-p194.


 $ ./run.rb wordlist.txt


 $ ruby ./spec.rb


Trung LE joneslee85@gmail.com