Given a list of strings, return a list of lists of strings that groups all anagrams

Question

1.00/5 (1 vote)

See more:

Question:
Given a list of strings, return a list of lists of strings that groups all anagrams.

Ex. given

C#

{"trees", "bike", "cars", "steer", "arcs"}

return

C#

{ {"cars", "arcs"}, {"bike"}, {"trees", "steer"} }

Not sure what is the best way?

Posted 15-Dec-14 4:18am

zhshqzyc

Add a Solution

Comments

Tomas Takac 15-Dec-14 10:24am

What did you try so far? Do you have the function to generate the anagrams?

[no name] 15-Dec-14 10:28am

I tried it but it was too complicated. Say I used a for loop then compare each item. I just want to find a quick way such as GroupBy in LINQ.

Tomas Takac 15-Dec-14 10:39am

Sorry, nevermind me, I cannot read apparently.

3 solutions

Solution 2

Easy way?
Sort them.
If you create a class which contains the original string and it sorted into alphabetical order, you can then sort the collection of your class by the ordered strings. The ones next to each other which are identical are anagrams.

But this is your homework, so I'll let you code it!

Posted 15-Dec-14 4:32am

OriginalGriff

Comments

Maciej Los 15-Dec-14 10:34am

Genius!
;)

Matt T Heffron 15-Dec-14 12:37pm

+5

Solution 1

Please, refer these:
http://www.blackwasp.co.uk/LinqAnagramCheck.aspx[^]
http://www.wiktorzychla.com/2008/02/using-linq-to-find-largest-group-of.html[^]
http://thecsharper.com/?p=64[^]
Try!

Posted 15-Dec-14 4:31am

Maciej Los

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

DamithSL · Accepted Answer · 2014-12-15T04:34:00

Solution 3

Lets try as below

C#

string[] words = new string[]{"trees", "bike", "cars", "steer", "arcs"};
var anagrams = words.GroupBy(w=>new string(w.OrderBy(c=>c).ToArray())).ToList();

Posted 15-Dec-14 4:34am

DamithSL

Comments

[no name] 15-Dec-14 10:39am

Fantastic. That is I want. +5!

BillWoodruff 15-Dec-14 21:43pm

+5

DamithSL 15-Dec-14 21:46pm

Thank you, BillWoodruff