Kata

Write a function unique_anagrams(word) that takes a string word as input and returns the number of unique anagrams that can be formed by rearranging the letters of the word.

Example: unique_anagrams("hello") # Output: 12 unique_anagrams("abc") # Output: 6 unique_anagrams("aaa") # Output: 0 Note:

You need to account for repeated characters in the input word. The output should be the count of unique anagrams. The function should handle both uppercase and lowercase letters as the same character. This problem involves understanding the concept of permutations and handling duplicate characters efficiently. It encourages the use of data structures and algorithms for an effective solution.