LeetCode/NeetCodeRoadmap/Arrays_and_Hashing/242_Valid_Anagram.py

27 lines
635 B
Python

def isAnagram(s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
seen = {}
check = {}
count = 0
for letter in s:
if letter in seen:
seen[letter] += 1
else:
seen[letter] = 1
for letter in t:
if letter in check:
check[letter] += 1
else:
check[letter] = 1
if seen != check:
return False
else:
return True
print(isAnagram("anagram", "nagaram"))
print(isAnagram("rat", "car"))
print(isAnagram("a", "ab"))