StringHashing
Two words are anagrams if one can be rearranged into the other using exactly the same letters. Decide whether the two given words are anagrams.
Input
Line 1: the string s. Line 2: the string t. Both contain only lowercase English letters.
Output
Print true if t is an anagram of s, otherwise false.
Constraints
1 <= length of s, t <= 5 * 10^4
Example 1
Input
anagram nagaram
Output
true
Both use a x3, n, g, r, m.
Example 2
Input
rat car
Output
false
t contains a c where s has a t.