<gh_stars>0
"""
LINK: https://leetcode.com/problems/valid-anagram/submissions/

Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: false
Note:
You may assume the string contains only lowercase alphabets.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
"""


def isAnagram(s, t):
    if len(s)!=len(t):
        return False
    elif s=="" and t=="":
        return True
    
    lookup = {}
    
    for char in s:
        if char in lookup:
            lookup[char] += 1
        else:
            lookup[char] = 1
            
    for char in t:
        if char in lookup:
            lookup[char] -= 1
        else:
            lookup[char] = 1
            
    for value in lookup.values():
        if value!=0:
            return False
        
    return True