22. Anagrams

Difficulty: 

Given two strings composed of spaces, punctuation marks and letters, determine if they are anagrams. Two strings are anagrams if ignoring non-letters and the case of letters, they consist of exactly the same number of letters. For example Dormitory and Dirty Room are anagrams, whereas bar and barb are not.

Input:

isAnagram("Election results", "Lies - Let's recount!");

Output:

true

Time Limit:

1000 (ms)

Hint (hover to see):

  • Hint #1

Results

ProblemsAcceptedWrongTimed OutError
150000

Input:

Expected Output:
Output: