@@ -0,0 +1,818 @@
+/**%0A * %0A */%0Apackage algorithms.strings;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * Challenge: https://www.hackerrank.com/challenges/making-anagrams%0A * %0A * @author Sudharsanan Muralidharan%0A */%0Apublic class MakingAnagrams %7B%0A  public static void main(String%5B%5D args) %7B%0A    Scanner in = new Scanner(System.in);%0A    String a = in.next();%0A    String b = in.next();%0A    int%5B%5D arr = new int%5B26%5D;%0A%0A    for (int i = 0; i %3C a.length(); i++) %7B%0A      char c = a.charAt(i);%0A      int index = c - 'a';%0A      arr%5Bindex%5D++;%0A    %7D%0A%0A    int%5B%5D arr2 = new int%5B26%5D;%0A    for (int i = 0; i %3C b.length(); i++) %7B%0A      char c = b.charAt(i);%0A      int index = c - 'a';%0A      arr2%5Bindex%5D++;%0A    %7D%0A%0A    int count = 0;%0A    for (int i = 0; i %3C 26; i++) %7B%0A      count += Math.abs(arr%5Bi%5D - arr2%5Bi%5D);%0A    %7D%0A%0A    System.out.println(count);%0A    in.close();%0A  %7D%0A%7D%0A

Add solution for MakingAnagrams