Anagram Check
Beginner
Two strings are anagrams if one can be rearranged into the other: they contain the same characters the same number of times. Return True if a and b are anagrams, otherwise False.
Examples
Example 1
Input:
is_anagram('listen', 'silent')
Output:
True
Example 2
Input:
is_anagram('rat', 'car')
Output:
False
Constraints
0 <= len(a), len(b) <= 2 * 10**5- Both strings contain only lower-case letters.
Theory
Go to TheoryKeywords
dsa-sheetbasicspython-toolbox
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.