Problem - Valid Anagram

Given two strings $s$ and $t$, return true if $t$ is an anagram of $s$, and false otherwise. An anagram uses the same characters with the same frequencies, just rearranged.

For example, "listen" and "silent" are anagrams. You're applying a direct application of frequency counting. Compare the frequency maps of both strings.