Easy · Arrays & hashing

Valid Anagram

You are given two strings, s and t. Return true if t uses exactly the same letters as s, the same number of times each, in any order. Otherwise return false.

  • Strings of different lengths can never be anagrams.
  • Both strings are lowercase letters only.
s = "anagram"
t = "nagaram"

→ true   (the same letters, rearranged)
Record your take

No one has solved it yet.