Skip to content
CodeShare
All problems

Valid Anagram

Decide whether two words use exactly the same letters.

EasyStringsHash map

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

An anagram uses exactly the same letters as the original, the same number of times, possibly in a different order.

Examples

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 * 10^4
  • s and t contain only lowercase English letters.