class Solution:
def isAnagram(self, s: str, t: str) -> bool:
map1 = {}
map2 = {}
for char in s:
if char not in map1:
map1[char] = 1
else :
map1[char] += 1
for char in t:
if char not in map2:
map2[char] = 1
else :
map2[char] += 1
return map1 == map2
Y2xhc3MgU29sdXRpb246CiAgICBkZWYgaXNBbmFncmFtKHNlbGYsIHM6IHN0ciwgdDogc3RyKSAtPiBib29sOgogICAgICAgIG1hcDEgPSB7fQogICAgICAgIG1hcDIgPSB7fQogICAgICAgIGZvciBjaGFyIGluIHM6CiAgICAgICAgICAgIGlmIGNoYXIgbm90IGluIG1hcDE6CiAgICAgICAgICAgICAgICBtYXAxW2NoYXJdID0gMQogICAgICAgICAgICBlbHNlIDoKICAgICAgICAgICAgICAgIG1hcDFbY2hhcl0gKz0gMQoKICAgICAgICBmb3IgY2hhciBpbiB0OgogICAgICAgICAgICBpZiBjaGFyIG5vdCBpbiBtYXAyOgogICAgICAgICAgICAgICAgbWFwMltjaGFyXSA9IDEKICAgICAgICAgICAgZWxzZSA6CiAgICAgICAgICAgICAgICBtYXAyW2NoYXJdICs9IDEKICAgICAgICAKICAgICAgICByZXR1cm4gbWFwMSA9PSBtYXAyCiAgICAgICAg