makingAnagrams.java

/* Alice is taking a cryptography class and finding anagrams to be very useful. We consider two strings to be anagrams of 
each other if the first string's letters can be rearranged to form the second string. In other words, both strings must 
contain the same exact letters in the same exact frequency. For example, bacdc and dcbac are anagrams, but bacdc and dcbad are not.

Alice decides on an encryption scheme involving two large strings where encryption is dependent on the minimum number of 
character deletions required to make the two strings anagrams. Can you help her find this number?

Given two strings, a and b, that may or may not be of the same length, determine the minimum number of character deletions 
required to make a and b anagrams. Any characters can be deleted from either of the strings.

Input Format
The first line contains a single string, a. 
The second line contains a single string, b.

Output Format
Print a single integer denoting the number of characters which must be deleted to make the two strings anagrams of each other. */

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int makingAnagrams(String s1, String s2){
        
        int i,count=0;
        int [] a = new int [26];
        int [] b = new int [26];
        
        for(i=0;i<s1.length();i++)
            a[s1.charAt(i)-'a']++;
        for(i=0;i<s2.length();i++)
            b[s2.charAt(i)-'a']++;
        
        for(i=0;i<26;i++)
            count=count+Math.abs(a[i]-b[i]);
        
        return count;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s1 = in.next();
        String s2 = in.next();
        int result = makingAnagrams(s1, s2);
        System.out.println(result);
    }
}