242. Valid Anagram Solution

Author: doh6077

valid-anagram/doh6077.py

@@ -0,0 +1,22 @@
+# 1. First, check if s and t have the same length. If not, they are not anagrams, so return False.
+# 2. Create a dictionary to count how frequently each character appears in s.
+# 3. Loop through t and check if each character appears with the same frequency as in the dictionary.
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+        if len(s) != len(t):
+            return False
+
+        char_counts = {}
+        for char_s in s:
+            char_counts[char_s] = s.count(char_s)
+
+        for char_t in t:
+            if char_t not in char_counts:
+                # t has a character that s doesn't have
+                return False
+            else:
+                count_in_t = t.count(char_t)
+                if count_in_t != char_counts[char_t]:
+                    return False
+
+        return True