anagramCount: [challenging] This method takes a single parameter and it must return the number distinct case-insensitive anagrams of the given word that have been added to the processor. An anagram consists of exactly the same number of letters as the given word with each character occurring the same number of times. However, identical words are not considered to be anagrams. For instance: "and" is an anagram of "dan" but "nan" is neither an anagram of "naan" nor of nan. Note that because the match must be case-insensitive, Dan is also an anagram of and. However, because the match is case-insensitive, all of Dan, dan and DAN only count as a single match for any of and, AND and And. Also, each anagram is only counted once, regardless of how many times it has been added to the processor via addWord.

I am using hashMap to store different words.

private HashMap words;

words = new HashMap<>();

public int anagramCount(String word) {

}