Leetcode 242 Valid Anagram

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

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return 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?

class Solution(object):
    def isAnagram(self, s, t):
        checker = [0 for i in range(26)]
        for x in s:
            checker[ord(x)-ord('a')] += 1
        for x in t:
            checker[ord(x)-ord('a')] -= 1
        for x in checker:
            if x:
                return False
        return True

class Solution(object):
    def isAnagram(self, s, t):
        s, t = list(s), list(t)
        s.sort()
        t.sort()
        return s == t