An anagram is the rearranging of letters of a word to make other words with meaning. The word itself is an example because you can rearrange the letters to spell words with one less character. The word Anagram<\/em> can be rearranged into ragman or Amarna as an example but there is a missing letter. When researching this topic, I was surprised to learn how rich the history of this was and I learned that it dates back to the ancient Greeks and Romans. [1<\/a>], [2<\/a>].<\/p>\n\n\n\n If you are a developer you may have run into this type of interview question already. I have seen interviewers ask this one right after the palindrome question. If you are new to this field it can be intimidating if you have not prepared for a code interview like the ones I am referring to. It is important to know how to explain what this is, how to implement it on the white board and in a virtual coding interview. Other than what I described above this is a nice to know in case the panel decides to throw it at you during the interview process. <\/p>\n\n\n\n As simple as an anagram seems, we can actually analyze how long an iterative algorithm implementation would run. If you had N characters from two words you can complete it in the worst case in O(2N) by ordering the characters of each word and then comparing.<\/p>\n\n\n\n <\/p>\n\n\n\n As I was preparing for this article I found it interesting how many ways a developer could implement an algorithm to determine if two words are anagrams of each other or finding all the possible combinations for one word. The following are just a few of the ones I either figured out on my own or adapted from various sources.<\/p>\n\n\n\n This determines if two words of the same count or different count are anagrams.<\/p>\n\n\n\nHow is this relevant to my life?<\/h4>\n\n\n\n
Complexity Analysis<\/h4>\n\n\n\n
Real Examples<\/h4>\n\n\n\n
First example in C# \u2013 Determine if two words are anagrams of each other for the same count as both words.<\/h4>\n\n\n\n
bool isAnagram = false;\nvar word1 = \"dog\";\nvar word2 = \"god\";\n\nisAnagram = input1.OrderBy(x => x).SequenceEqual(input2.OrderBy(x => x));\n<\/pre>\n\n\n\n
Interface implementation variation 1 <\/h4>\n\n\n\n