• View
• Edit
• History
• Print

20130211a

Anagram

An anagram is a type of word play, the result of rearranging the letters of a word or phrase to produce a new word or phrase, using all the original letters exactly once.

Examples:

1. listen = silent
2. A gentleman = Elegant man
3. Clint Eastwood = Old west action
4. more

Write a function that receives two strings and decides if the second string is an anagram of the first one. As you can see from the examples, whitespaces and upper and lower case letters don't matter.

The exercise can be solved in different ways. There is a trivial method, but I'd like to see a non-trivial solution. Thus, try to find at least two different approaches to solve this exercise.