I initially thought to sort the input strings alphabetically, but that would have resulted in O(n*log(n)) time complexity, when it's possible to solve this particular problem a bit faster.

```
class Solution(object):
def isAnagram(self, s, t):
if len(s) != len(t):
return False
list_s = [0]*26
list_t = [0]*26
for ch in s:
list_s[ord(ch)-97] += 1
for ch in t:
list_t[ord(ch)-97] += 1
return list_s == list_t
```