Valid Anagram

Given two strings s and t, return True if t is an anagram of s, and False otherwise.

An anagram is a word formed by rearranging the letters of another word, using every letter exactly once.

---

Example 1

Input: s = "anagram", t = "nagaram"
Output: True
Explanation: Both strings contain exactly the same characters with the same frequencies.

Example 2

Input: s = "rat", t = "car"
Output: False
Explanation: "rat" and "car" share some characters but not with the same frequencies.

---

Constraints

• 1 <= s.length, t.length <= 5 * 10^4
• s and t consist of lowercase English letters.