import java.util.Hashtable; import java.util.Set; public class Anagram { static String string1 = "aab"; static String string2 = "aba"; static String string3 = "cab"; static String string4 = "kjfdhskdhfksdhk"; public boolean anagram(String x, String y) { if (x == y) return true; if (x.length() != y.length()) return false; Hashtable dictx = new Hashtable(); Hashtable dicty = new Hashtable(); for(int i=0; i keys = dictx.keySet(); for(String key: keys) { if (dicty.containsKey(key)) { if (dictx.get(key) != dicty.get(key)) { return false; } } else { return false; } } return true; } public static void main(String[] args) { Anagram foo = new Anagram(); System.out.printf("1 %s\n", foo.anagram(string1, string1)); System.out.printf("2 %s\n", foo.anagram(string1, string2)); System.out.printf("3 %s\n", foo.anagram(string1, string3)); System.out.printf("4 %s\n", foo.anagram(string1, string4)); } }