Codewars #13 Anagram Detection (7kyu)

#13 Anagram Detection

An anagram is the result of rearranging the letters of a word to produce a new word (see wikipedia).

Note: anagrams are case insensitive

Complete the function to return true if the two arguments given are anagrams of theeach other; return false otherwise.

Examples :

"foefet" is an anagram of "toffee"

"Buckethead" is an anagram of "DeathCubeK"

import java.util.Arrays;

public class Kata {
	  public static boolean isAnagram(String test, String original) {
		    if(test.length() != original.length()) return false;
		    
		    test = test.toLowerCase();
		    original = original.toLowerCase();
		    String [] temp = test.split("");
		    Arrays.sort(temp);
		    test = String.join("",temp);
		    temp = original.split("");
		    Arrays.sort(temp);
		    original = String.join("",temp);

		    if(test.equals(original)) return true;

		    return false;
	  }
}