Added Validate Anagram

puneet29 · Dec 29, 2024 · 781adc1 · 781adc1
1 parent 417959b
commit 781adc1
Show file tree

Hide file tree

Showing 2 changed files with 20 additions and 0 deletions.
diff --git a/LeetCode/README.md b/LeetCode/README.md
@@ -35,6 +35,7 @@
 | [Swap nodes in pairs](SwapNodesInPairs.py)                                              | :heavy_check_mark: | `#recursion` `#linked-list`                               | Python    |
 | [Two Sum](TwoSum.py)                                                                    | :heavy_check_mark: | `#array` `#hash-table`                                    | Python    |
 | [Validate Binary Search Tree](ValidateBinarySearchTree.py)                              | :heavy_check_mark: | `#recursion` `#tree`                                      | Python    |
+| [Validate Anagram](ValidateAnagram.py)                                                  | :heavy_check_mark: | `#hash-table` `#string` `sorting`                         | Python    |
 | [Valid Parantheses](ValidParantheses.py)                                                | :heavy_check_mark: | `#string` `#stack`                                        | Python    |
 | [ZipZag Conversion](ZigZagConversion.py)                                                | :heavy_check_mark: | `#string`                                                 | Python    |
 

diff --git a/LeetCode/ValidAnagram.py b/LeetCode/ValidAnagram.py
@@ -0,0 +1,19 @@
+class Solution(object):
+    def isAnagram(self, s, t):
+        """
+        :type s: str
+        :type t: str
+        :rtype: bool
+        """
+        word_freq = {}
+        for word in s:
+            if word in word_freq:
+                word_freq[word] += 1
+            else:
+                word_freq[word] = 1
+        for word in t:
+            if word in word_freq:
+                word_freq[word] -= 1
+            else:
+                return False
+        return True if all(val == 0 for val in word_freq.values()) else False