Valid Anagram String Check

Problem

Given two strings s and t, return true if t is an anagram of s, and false otherwise. Two strings are anagrams if they contain exactly the same characters with the same frequencies, possibly in a different order.

Constraints

• 1 <= len(s), len(t) <= 5 * 10^4
• s and t consist of lowercase English letters
• The solution should handle repeated characters correctly