Leetcode accepted

PriyankaKhire · PriyankaKhire · commit 5f8000ddff35 · 2021-08-26T19:56:01.000-07:00
diff --git a/Blind 75/Programs/Valid Anagram.py b/Blind 75/Programs/Valid Anagram.py
@@ -0,0 +1,33 @@
+# Valid Anagram
+# https://leetcode.com/problems/valid-anagram/
+
+class Solution(object):
+    def putInHash(self, s):
+        hashTable = {}
+        for char in s:
+            if (char not in hashTable):
+                hashTable[char] = 0
+            hashTable[char] = hashTable[char] + 1
+        return hashTable
+    
+    def searchInHash(self, t, hashTable):
+        # find the char in hash table.
+        for char in t:
+            if (char not in hashTable):
+                return False
+            hashTable[char] = hashTable[char] - 1
+        # Make sure all count is zero in hash table
+        for key in hashTable:
+            if (hashTable[key] != 0):
+                return False
+        return True
+                
+    def isAnagram(self, s, t):
+        hashTable = self.putInHash(s)
+        return self.searchInHash(t, hashTable)
+        """
+        :type s: str
+        :type t: str
+        :rtype: bool
+        """
+        
diff --git a/Blind 75/README.md b/Blind 75/README.md
@@ -230,7 +230,10 @@
         </p>
       </li>
       <li>Minimum Window Substring</li>
-      <li>Valid Anagram</li>
+      <li><a href="Programs/Valid Anagram.py">Valid Anagram</a> 
+        <p><b>Approach</b>: Used hash table.
+        </p>
+      </li>
       <li>Group Anagrams</li>
       <li>Valid Parentheses</li>
       <li>Valid Palindrome</li>
