Anagram Detector

Function Name: areAnagrams

Description

An anagram is a word or phrase that's formed by rearranging the letters of another word or phrase. For example, 'listen' is an anagram of 'silent'.

Write a function 'areAnagrams' that takes two strings and returns a boolean indicating whether or not they are anagrams of each other.

The comparison should be case-insensitive and should disregard any non-alphabetical characters.

The function should focus on performance for larger strings.

Requirements

• The function should be named 'areAnagrams' and take exactly two parameters, both strings.
• The function should return a boolean: true if the strings are anagrams, false if they are not.
• Non-alphabetical characters should be ignored in the comparison.
• The comparison should be case-insensitive.
• Handling of spaces is important: spaces do not count toward the anagram property.
• Empty strings or strings with only non-alphabetical characters should be treated as not anagrams.
• The solution should handle large strings efficiently.

Examples

areAnagrams('listen', 'silent') // should return trueareAnagrams('Hello, world!', 'hello world') // should return trueareAnagrams('New York Times', 'monkeys write') // should return trueareAnagrams('Debit Card', 'Bad Credit') // should return trueareAnagrams('School master', 'The classroom') // should return trueareAnagrams('Astronomers', 'Moon starers') // should return trueareAnagrams('Conversation', 'Voices rant on') // should return trueareAnagrams('Listen', 'Silent') // should return trueareAnagrams('Hello, world!', 'Goodbye, world!') // should return falseareAnagrams('Batman', 'Manbat') // should return false, since it's a word for word comparison

Links