Code golf: find all anagrams

Posted by Charles Ma on Stack Overflow See other posts from Stack Overflow or by Charles Ma
Published on 2010-04-02T09:23:09Z Indexed on 2010/04/02 9:33 UTC
Read the original article Hit count: 720

Filed under:

code-golf

|

anagram

An word is an anagram if the letters in that word can be re-arranged to form a different word.

Task:

Find all sets of anagrams given a word list

Input:

a list of words from stdin with each word separated by a new line

e.g.

A
A's
AOL
AOL's
Aachen
Aachen's
Aaliyah
Aaliyah's
Aaron
Aaron's
Abbas
Abbasid
Abbasid's

Output:

All sets of anagrams, with each set separated by a separate line

Example run:

./anagram < words
marcos caroms macros
lump's plum's
dewar's wader's
postman tampons
dent tend
macho mocha
stoker's stroke's
hops posh shop
chasity scythia
...

I have a 149 char perl solution which I'll post as soon as a few more people post :)

Have fun!

© Stack Overflow or respective owner

Related posts about code-golf

Code Golf: Collatz Conjecture

as seen on Stack Overflow - Search for 'Stack Overflow'
Inspired by http://xkcd.com/710/ here is a code golf for it. The Challenge Given a positive integer greater than 0, print out the hailstone sequence for that number. The Hailstone Sequence See Wikipedia for more detail.. If the number is even, divide it by two. If the number is odd, triple… >>> More
Code Golf - p day

as seen on Stack Overflow - Search for 'Stack Overflow'
The Challenge The shortest code by character count to display a representation of a circle of radius R using the *character, followed by an approximation of p. Input is a single number, R. Since most computers seem to have almost 2:1 ratio you should only output lines where y is odd. The approximation… >>> More
Code Golf - PI day

as seen on Stack Overflow - Search for 'Stack Overflow'
The Challenge The shortest code by character count to display a representation of a circle of radius R using the *character. Followed by an approximation of pi Input is a single number, R Since most computers seem to have almost 2:1 ratio you should only output lines where y is odd. The approximation… >>> More
Code Golf: Triforce

as seen on Stack Overflow - Search for 'Stack Overflow'
This is inspired by/taken from this thread: http://www.allegro.cc/forums/thread/603383 The Problem Assume the user gives you a numeric input ranging from 1 to 7. Input should be taken from the console, arguments are less desirable. When the input is 1, print the following: *********** *********… >>> More
Code Golf: Tic Tac Toe

as seen on Stack Overflow - Search for 'Stack Overflow'
Post your shortest code, by character count, to check if a player has won, and if so, which. Assume you have an integer array in a variable b (board), which holds the Tic Tac Toe board, and the moves of the players where: 0 = nothing set 1 = player 1 (X) 2 = player 2 (O) So, given the array b… >>> More

Related posts about anagram

Java Anagram Solver

as seen on Stack Overflow - Search for 'Stack Overflow'
I can work out how to create anagrams of a string but I don't know how I can compare them to a dictionary of real words to check if the anagram is a real word. Is there a class in the Java API that contains the entire English dictionary? >>> More
Anagram of a word

as seen on Stack Overflow - Search for 'Stack Overflow'
How to print anagrams of a word from a dictionary? how to optimize it if we have to do this repeatedly?? is there any java code explanation ?? >>> More
Java anagram recursion List<List<String>> only storing empty lists<Strings>

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi In this recursion method i am trying to find all anagrams and add it to a List but what happens when i run this code is it just returns alot of empty Lists. private List<List<String>> findAnagrams(LetterInventory words, ArrayList<String> anagram, int max, … >>> More
Word Anagram Hashing Algorithm?

as seen on Stack Overflow - Search for 'Stack Overflow'
Given set of words, we need to find the anagram words and display each category alone using the best algorithm input: man car kile arc none like output: man car arc kile like none the best solution I am developing now is based on a hashtable, but I am thinking about equation to convert anagram… >>> More
anagram!! problem with this code

as seen on Stack Overflow - Search for 'Stack Overflow'
hello people!! i have a problem with this code can you fix it for me? int anagram(char* word, int cur, int len){ int i, b = cur+1; char temp=0; char arrA[len]; printf("//%d**%d//", b, cur); for (i = 0 ; i < len ; i++) { arrA[i] = word[i]; } for (i = cur ; i < len ; i++) { if… >>> More