Valid Anagram
Easy
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.
Examples:
Example 1:
Input:"anagram", "nagaram"
Output:true
Example 2:
Input:"rat", "car"
Output:false
Constraints:
- 1 <= s.length, t.length <= 5 * 10^4
- s and t consist of lowercase English letters
Limits:
Time limit: 1000 ms
Memory limit: 128 MB
Topics
Hash Table
Loading editor...
▶
Run your code to test against examples