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?
class Solution:
     def isAnagram(self, s, t):
         """
         :type s: str
         :type t: str
         :rtype: bool
         """
         S = set(s)
         T = set(t)
         if len(s) != len(t):
             return False
         for i in T:
             if i in S:
                 if s.count(i) != t.count(i):
                     return False
             else:
                 return False
         return True

class Solution:
     def isAnagram(self, s, t):
         """
         :type s: str
         :type t: str
         :rtype: bool
         """
         S = set(s)
         T = set(t)
         if len(s) != len(t):
             return False
         for i in T:
             if i in S:
                 if s.count(i) != t.count(i):
                     return False
             else:
                 return False
         return True
