finding if two words are anagrams of each other

Question

I am looking for a method to find if two strings are anagrams of one another.

Ex: string1 - abcde
string2 - abced
Ans = true
Ex: string1 - abcde
string2 - ab         


        

Answer 1

1. Create a Hashmap where key - letter and value - frequencey of letter,
2. for first string populate the hashmap (O(n))
3. for second string decrement count and remove element from hashmap O(n)
4. if hashmap is empty, the string is anagram otherwise not.