Programming Interview Questions 16: Anagram Strings | Arden DertatArden Dertat

Programming Interview Questions 16: Anagram Strings | Arden DertatArden Dertat

Given two strings, check if they're anagrams or not. Two strings are anagrams if they are written using the same exact letters, ignoring space, punctuation and capitalization. Each letter should have the same count in both strings. For example, 'Eleven plus two' and 'Twelve plus one' are meaningful anagrams of each other.

First we should extract only the letters from both strings and convert to lowercase, excluding punctuation and whitespaces. Then we can compare these to check whether two strings are anagrams of each other. From now on when I refer to a string, I assume this transformation is performed and it only contains lowercase letters in original order.

Read full article from Programming Interview Questions 16: Anagram Strings | Arden DertatArden Dertat