Valid Anagram

Easy

/problems/valid-anagram

2000 ms128 MB2 visible tests

Problem statement

Two strings are anagrams when they use the same letters with the same frequencies, possibly in a different order. Decide whether the provided strings are anagrams.

Your function

Implement this function and return the result. CodeSprint supplies each test case automatically.

isAnagram(s, t) → boolean

s: stringt: string

Examples

Example 1

Input

s = "listen", t = "silent"

Output

true

Example 2

Input

s = "rat", t = "car"

Output

false

Constraints

0 <= s.length, t.length <= 100,000
Both strings contain lowercase English letters.