no message

Author: Partho Biswas

README.md

@@ -969,6 +969,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |05| [Underscorify_Substring](algoexpert.io/questions/Underscorify_Substring.md) | [Python](algoexpert.io/python/Underscorify_Substring.py)| --- | Hard | TODO: Check again. Difficult to analyse the space ad time complexity |
 |06| [Pattern_Matcher](algoexpert.io/questions/Pattern_Matcher.md) | [Python](algoexpert.io/python/Pattern_Matcher.py)|
 |07| [Smallest_Substring_Containing](algoexpert.io/questions/Smallest_Substring_Containing.md) | [Python](algoexpert.io/python/Smallest_Substring_Containing.py)|
+|08| [Group_Anagrams](algoexpert.io/questions/Group_Anagrams.md) | [Python](algoexpert.io/python/Group_Anagrams.py)|
 
 </p>
 </details>

algoexpert.io/python/Group_Anagrams.py

@@ -0,0 +1,7 @@
+from collections import defaultdict
+def groupAnagrams(words):
+    anagrams = defaultdict(list)
+	for word in words:
+		sortedWord = "".join(sorted(word))
+		anagrams[sortedWord].append(word)
+	return list(anagrams.values())

algoexpert.io/python/Min_Max_Stack_Construction.py

@@ -1,8 +1,4 @@
-# https://www.algoexpert.io/questions/Min%20Max%20Stack%20Construction
-
-
 class MinMaxStack:
-
     def __init__(self):
         # only contains the min and max value at any given time
         # min_max_stack is an array of dictionary, which is the same length of stack
@@ -24,21 +20,14 @@ def push(self, number):
         if len(self.min_max_stack):
             last_min_max = self.min_max_stack[len(self.min_max_stack) - 1]
             new_min_max["min"] = min(last_min_max["min"], number)
-            new_min_max["max"] = min(last_min_max["max"], number)
+            new_min_max["max"] = max(last_min_max["max"], number)
         self.min_max_stack.append(new_min_max)
         self.stack.append(number)
 
     # O(1) time | O(1) space
-    def get_min(self):
+    def getMin(self):
         return self.min_max_stack[len(self.min_max_stack) - 1]["min"]
 
     # O(1) time | O(1) space
-    def get_max(self):
+    def getMax(self):
         return self.min_max_stack[len(self.min_max_stack) - 1]["max"]
-
-
-
-
-
-
-