@@ -0,0 +1,1024 @@
+package javaAnagrams;%0A%0Aimport java.util.Scanner;%0A%0A%0Apublic class Solution %7B%0A%0A%09   static boolean isAnagram(String A, String B) %7B%0A%09%09   if( A.length() != B.length() )%0A%09%09%09   return false;%0A%09%09   int arrayLength = 256;%0A%09       int%5B%5D arrayOne = new int%5BarrayLength%5D,%0A%09    %09%09 arrayTwo = new int%5BarrayLength%5D;%0A%09       for(int i = 0; i %3C A.length(); ++i) %7B%0A%09    %09   arrayOne%5B(A.charAt(i) - '0' - 1)%5D += 1;%0A%09    %09   arrayTwo%5B(B.charAt(i) - '0' - 1)%5D += 1;%0A%09       %7D%0A%09       for(int i = 0; i %3C arrayLength; ++i) %7B%0A%09    %09   if(arrayOne%5Bi%5D != arrayTwo%5Bi%5D)%0A%09    %09%09  return false;%0A%09       %7D%0A%09%09   return true;%0A%09   %7D%0A%09    public static void main(String%5B%5D args) %7B%0A%09        Scanner scanner = new Scanner(System.in);%0A%09        String wordOne = scanner.next();%0A%09        String wordTwo = scanner.next();%0A%09        boolean decision = isAnagram(wordOne.toLowerCase(), wordTwo.toLowerCase());%0A%09        if(decision)%0A%09        %09System.out.println(%22Anagrams%22);%0A%09        else %0A%09        %09System.out.println(%22Not Anagrams%22);%0A%09        scanner.close();%0A%09    %7D%0A%09%7D%0A

Add problem Java Anagrams, HackerRank/Java/Strings/Java String