# Problem Statement Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise. ## Constraints - `1 <= s.length, t.length <= `$5*10^4$ - `s` and `t` consist of lowercase English letters. # Solution We can compare the frequencies of the characters in each string using [[Python Counter|Counter]]. If the frequencies match, they are anagrams of each other. ```python return Counter(s) == Counter(t) ``` Time Complexity: O$(n)$ | Space Complexity: O$(n)$