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
Character comparison is case-sensitive
Aim for O(n) time instead of sorting-based O(n log n)
Function Signature
defis_anagram(s, t):
Interviewer
Your question is Check If Two Strings Are Anagrams. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
