LeetCode 242 – Python 3 (Week 06 – 07)

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        if len(s) != len(t):
            return False
        
        s = list(s)
        t = list(t)
        s.sort()
        t.sort()
        for i in range(len(s)):
            if s[i] != t[i]: return False
            
        return True

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        return sorted(s) == sorted(t)

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        if len(s) != len(t):
            return False
        
        dic1, dic2 = [0]*26, [0]*26
        
        for i in range(len(s)):
            dic1[ord(s[i]) - ord('a')] += 1
            dic2[ord(t[i]) - ord('a')] += 1
            
        return dic1 == dic2