242. Valid Anagram

Problem Link

Description

---

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

 

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?

Solution

---

Python3

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        count = [0] * 26
 
        for x in s:
            count[ord(x) - ord('a')] += 1
        
        for x in t:
            count[ord(x) - ord('a')] -= 1
            if count[ord(x) - ord('a')] < 0:
                return False
        
        return all(x == 0 for x in count)