Created
February 5, 2009 19:07
-
-
Save jarib/58923 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
The challenge is fairly simple: given a file containing one word per line, print out all the combinations of words that are anagrams; each line in the output contains all the words from the input that are anagrams of each other. For example, your program might include in its output: | |
kinship pinkish | |
enlist inlets listen silent | |
boaster boaters borates | |
fresher refresh | |
sinks skins | |
knits stink | |
rots sort |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment