242-valid_anagram.py

"""

https://leetcode.com/problems/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 * 10^4
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?

"""

from collections import defaultdict

def isAnagram(s: str, t: str) -> bool:
    
    if len(s) != len(t):
        return False
    
    sCounts = defaultdict(int)
    
    for char in s:
        sCounts[char] += 1
    
    for char in t:
        sCounts[char] -= 1
    
    for item in sCounts.values():
        if item != 0:
            return False

    return True

if __name__ == '__main__':
    s = "anagram"
    t = "nagaram"
    print(isAnagram(s, t))