Leetcode 242. Valid Anagram. Python (3 Ways)

 242. Valid Anagram

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

 

Example 1:

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: false

 

Constraints:

• 1 <= s.length, t.length <= 5 * 104
• s and t consist of lowercase English letters.

 

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        return sorted(s) == sorted(t)
        
#       return Counter(s) == Counter(t)
#         cs, ct = {}, {}
        
#         if len(s) != len(t):
#             return False
        
#         for i in range(len(s)):
#             cs[s[i]] = 1 + cs.get(s[i], 0)
#             ct[t[i]] = 1 + ct.get(t[i], 0)
        
#         for c in cs:
#             if cs[c] != ct.get(c,0):
#                 return False
            
#         return True

Explaination :