While browsing the net, I found this problem somewhere - to write a code that tests the given two strings are anagrams or not. From Wiki,
'AnÂ anagramÂ is a type ofÂ word play, the result of rearranging the letter of a word or phrase to produce a new word or phrase, using all the original letters exactly once; for exampleÂ orchestraÂ can be rearranged intoÂ carthorse.'Â
I tried to solve this problem using Java and below is the result of it. The algorithm I tried is very simple:
- Clean the input - remove all the spaces and punctuation marks (because it doesn't affect theÂ compassion).
- Go through character by character from string one and check if that character exists in string two.
- If exists, then remove it from string *two *and move on to next character. If not exists, then we found a mismatch and the string is not an anagram.
- If all character from string one *exists in string *two, then we found it's an anagram.
Â Java code to test two strings are anagrams:
I tested the above code with most of the anagrams found in the Anagram Site and it worked well.
If you think the above code can be improved in someway, feel free to comment.