Search
⌘K

Leetcode 242. Valid Anagram

Determine whether two strings are anagrams — i.e., contain the same multiset of characters — by comparing their character frequency distributions (or sorted forms). Inputs are lowercase English letters (length up to 5×10^4); for Unicode you would use a hash map for counts instead of a fixed-size array.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.