From b041054b3e08473d640b2b1b5d660dd309db85bb Mon Sep 17 00:00:00 2001
From: SterlingSunshine <katrina.kimzey@gmail.com>
Date: Mon, 13 Dec 2021 00:06:28 -0800
Subject: [PATCH] First two test sets passing

---
 hash_practice/exercises.py | 43 ++++++++++++++++++++++++++++++++------
 1 file changed, 37 insertions(+), 6 deletions(-)

diff --git a/hash_practice/exercises.py b/hash_practice/exercises.py
index 48bf95e..93d09e0 100644
--- a/hash_practice/exercises.py
+++ b/hash_practice/exercises.py
@@ -2,18 +2,49 @@
 def grouped_anagrams(strings):
     """ This method will return an array of arrays.
         Each subarray will have strings which are anagrams of each other
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: O(n log m)
+        Space Complexity: O(n)
     """
-    pass
+    if len(strings) < 1:
+        return []
+
+    anagrams = dict()
+
+    for string in strings:
+        key_string = "".join(sorted(string))
+
+        if key_string in anagrams:
+            anagrams[key_string].append(string)
+        else:
+            anagrams[key_string] = [string]
+
+    return [anagrams[group] for group in anagrams]
+
 
 def top_k_frequent_elements(nums, k):
     """ This method will return the k most common elements
         In the case of a tie it will select the first occuring element.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: At least O(n) assuming that max() is an O(1) look up but I strongly suspect it isn't
+        Space Complexity: At least O(n + k)
+        (Not sure about the big O here becuase I'm not certain how max works in this case)
     """
-    pass
+    if len(nums) < 1:
+        return []
+
+    freq_dict = dict()
+
+    for num in nums:
+        if num in freq_dict:
+            freq_dict[num] += 1
+        else:
+            freq_dict[num] = 1
+
+    top_k = []
+    for i in range(k):
+        top_k.append(max(freq_dict, key=freq_dict.get))
+        freq_dict.pop(top_k[i])
+
+    return top_k
 
 
 def valid_sudoku(table):