public class Solution {
    public boolean areAnagrams(String first, String second) {

        HashMap<Character, Integer> firstMap = new HashMap();
        HashMap<Character, Integer> secondMap = new HashMap();

        String cleanWord1 = first.toLowerCase().replace(" ", "");
        String cleanWord2 = second.toLowerCase().replace(" ", "");

        if (cleanWord1.length() != cleanWord2.length()) {
            return false;
        }

        for(int i = 0; i < cleanWord1.length(); i++) {

            char c1 = cleanWord1.charAt(i);
            char c2 = cleanWord2.charAt(i);

            firstMap.put(c1, firstMap.getOrDefault(c1, 0) + 1);
            secondMap.put(c2, secondMap.getOrDefault(c2, 0) + 1);

        }

        return firstMap.equals(secondMap);
    }
}