5. Valid Anagram
Hash TableStrings
Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.
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.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Explanation: Letters and counts match.
Example 2:
Input: s = "rat", t = "car"
Output: false
Explanation: Characters differ.
Constraints:
- 1 <= s.length, t.length <= 5 * 10^4
- s and t consist of lowercase English letters.
Integrity: 100%
Loading...
Input Arguments:
s = "anagram", t = "nagaram"
Expected Output:
true