| English | 简体中文 |
Given two strings
t is an anagram of
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Input: s = "anagram", t = "nagaram" Output: true
Input: s = "rat", t = "car" Output: false
1 <= s.length, t.length <= 5 * 104
tconsist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?