6. Valid Anagram
EasyArrays & Hashing Verified judge
Given two strings s and t, return true if t is an anagram of s, and false otherwise. An anagram uses all the original letters exactly once.
Example 1
Input
anagram nagaram
Output
true
Example 2
Input
rat car
Output
false
Input format
Input: line 1 = s, line 2 = t. Output: `true` or `false`.
Constraints
- 1 ≤ s.length, t.length ≤ 5*10^4
- s and t consist of lowercase English letters
Verified judge
Expected output
true