Check If Two Strings Are Anagrams

Problem

Given two strings s and t, return True if t is an anagram of s, otherwise return False. 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) <= 10^5
• s and t consist of printable characters
• Aim for a solution with linear time and minimal extra space