Valid Anagram

This problem is part of solulu Pro

Two strings are anagrams if one can be rearranged to form the other — they use exactly the same letters, each the same number of times. Given lowercase strings s and t, return true if t is an anagram of s.