Simple Python O(n) Solution
class Solution(object):\n        def isAnagram(self, s, t):\n            maps = {}\n            mapt = {}\n            for c in s:\n                maps[c] = ma
    class Solution(object):\n        def isAnagram(self, s, t):\n            maps = {}\n            mapt = {}\n            for c in s:\n                maps[c] = maps.get(c,0)+1\n            for c in t:\n                mapt[c] = mapt.get(c,0)+1\n            return maps == mapt
[]