diff --git a/hash_practice/exercises.py b/hash_practice/exercises.py
index 48bf95e..cfafcfc 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)
+        Space Complexity: O(n)
     """
-    pass
+    anagrams = {}
+    for word in strings:
+        alphabet = [0] * 26
+        for letter in word:
+            alphabet[ord(letter.lower()) - ord("a")] += 1
+        if tuple(alphabet) in anagrams:
+            anagrams[tuple(alphabet)].append(word)
+        else:
+            anagrams[tuple(alphabet)] = [word]
+
+    return_list = []
+    for k, v in anagrams.items():
+        return_list.append(v)
+    return return_list
 
 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: O(n)
+        Space Complexity: O(n)
     """
-    pass
+    if len(nums) == 0:
+        return []
+
+    count = []
+    element_dict = {}
+
+    for elem in nums:
+        if elem in element_dict:
+            element_dict[elem] += 1
+        else:
+            element_dict[elem] = 1
+
+    while len(count) < k:
+        highest_key = max(element_dict, key=element_dict.get)
+        count.append(highest_key)
+
+        del element_dict[highest_key]
+
+    return count
 
 
 def valid_sudoku(table):