Hey Lars, thanks for checking out my article! I took a look at your solution, and I missed something in my code that you caught on line 2... the words must be shuffled in order for it to be considered an anagram! So I need to add a bit of code that returns false if the words are exactly the same! Also, I would suggest adding some code to check the number of occurrences of each letter to your code. As it stands now, "stressed" and "deserts" would return true which is correct, but so would "stressed" and "dessertd"... which should return false.

◄◄Software Engineer►► ◄◄Web Developer►►