problem242

README

< Previous 　　　　　　　　　　　　　　　　 Next >

242. Valid Anagram (Easy)

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

 

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: false

 

Constraints:

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

 

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

Related Topics

[Sort] [Hash Table]

Similar Questions

1. Group Anagrams (Medium)
2. Palindrome Permutation (Easy)
3. Find All Anagrams in a String (Medium)