What is an easy way to tell if a list of words are anagrams of each other?

Question

How would you list words that are anagrams of each other?

I was asked this question when I applied for my current job.

orchestra can be rearrang

Answer 1

Tried hashcode logic for anagram gives me false output

public static Boolean anagramLogic(String s,String s2){
    char[] ch1 = s.toLowerCase().toCharArray();
        Arrays.sort(ch1);
        char[] ch2= s2.toLowerCase().toCharArray();
        Arrays.sort(ch2);
        return ch1.toString().hashCode()==ch2.toString().hashCode(); //wrong
    }

to rectify this code, below is the only option I see,appreciate any recommendations

char[] ch1 = s.toLowerCase().toCharArray();
        Arrays.sort(ch1);
        char[] ch2= s2.toLowerCase().toCharArray();
        Arrays.sort(ch2);
        return Arrays.equals(ch1,ch2);
    }

Answer 2

Put all the letters in alphabetical order in the string (sorting algorithm) and then compare the resulting string.

Answer 3

The following algorithm should work:

1. Sort the letters in each word.

2. Sort the sorted lists of letters in each list.

3. Compare each element in each list for equality.

Answer 4

Interestingly enough, Eric Lippert's Fabulous Adventures In Coding Blog dealt with a variation on this very problem on February 4, 2009 in this post.

Answer 5

Sort the letters and compare (letter by letter, string compare, ...) is the first things that comes to mind.

Answer 6

Well Sort the words in the list.

if abc, bca, cab, cba are the inputs, then the sorted list will be abc, abc, abc, abc.

Now all of their Hash codes are equal. Compare the HashCodes.