solves valid anagram in python

Author: anishLearnsToCode

README.md

@@ -72,7 +72,7 @@
 | 234 | [Palindrome Linked Lists](https://leetcode.com/problems/palindrome-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PalindromeLinkedList.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/palindrome_linked_list.py) | 
 | 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LowestCommonAncestorOfBinarySearchTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/lowest_common_ancestor_of_bst.py) |
 | 237 | [Delete a Node In A Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/DeleteANodeInLinkedList.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/delete_node_in_linked_list.py) |
-| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidAnagram.java) |
+| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidAnagram.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/delete_node_in_linked_list.py) |
 | 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | Easy | |
 | 246 | [Strobogramatic Number](https://leetcode.com/problems/strobogrammatic-number) | Easy | |
 | 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms) | Easy | |

python/lowest_common_ancestor_of_bst.py

@@ -8,12 +8,6 @@ def __init__(self, x):
         self.left = None
         self.right = None
 
-    def __repr__(self):
-        return str(self.val)
-
-    def __str__(self):
-        return str(self.val)
-
 
 class Solution:
     def get_path_to(self, root: TreeNode, node: TreeNode) -> deque:

python/valid_anagram.py

@@ -0,0 +1,16 @@
+from typing import Dict
+
+
+class Solution:
+    def character_frequency(self, string: str) -> Dict[str, int]:
+        frequencies = {}
+        for character in string:
+            frequencies[character] = frequencies.get(character, 0) + 1
+        return frequencies
+
+    def isAnagram(self, s: str, t: str) -> bool:
+        if len(s) != len(t):
+            return False
+        char_freq_s = self.character_frequency(s)
+        char_freq_t = self.character_frequency(t)
+        return char_freq_s == char_freq_t