diff --git a/lib/exercises.rb b/lib/exercises.rb
index e1b3850..df6609a 100644
--- a/lib/exercises.rb
+++ b/lib/exercises.rb
@@ -1,19 +1,85 @@
 
 # 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) where n is number of strings
+# O(n) to build strings_map, O(n) to build reverse_map, O(n) to build answer_array
+# Space Complexity: O(n) where n is number of strings
+# While there is a large amount of data structures, they scale linearly
 
 def grouped_anagrams(strings)
-  raise NotImplementedError, "Method hasn't been implemented yet!"
+  # Put strings into hash map of string -> # of occurrences of character
+  # Luckily {a:1, b:2} == {b:2, a:1}
+  strings_map = {}
+  strings.each do |string|
+    letter_map = Hash.new(0)
+    string.each_char do |char|
+      letter_map[char] += 1
+    end
+
+    strings_map[string] = letter_map
+
+  end
+
+  # Reverse the hash
+  reverse_map = Hash.new([])
+  strings_map.each do |key, value|
+    if reverse_map[value] == []
+      reverse_map[value] = [key]
+    else
+      reverse_map[value].push(key)
+    end
+  end
+
+  # Build answer array
+  answer_array = []
+  reverse_map.each do |key, value|
+    answer_array.push(value)
+  end
+
+  return answer_array
 end
 
 # 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 log n) - O(n) to build map, O(n) to reverse,
+# O(n log n) to sort, O(n) to find answer where n is amount of numbers
+# Space Complexity: O(n) - Similarly to last time, there's a decent overhead but it scales linearly
 def top_k_frequent_elements(list, k)
-  raise NotImplementedError, "Method hasn't been implemented yet!"
+  return [] if list == []
+
+  # Build hash map of number -> occurrences
+  num_map = Hash.new(0)
+  list.each do |num|
+    num_map[num] += 1
+  end
+
+  # Reverse it
+  key_map = Hash.new([])
+  num_map.each do |key, value|
+    if key_map[value] == []
+      key_map[value] = [key]
+    else
+      key_map[value].push(key)
+    end
+  end
+
+  # Sort the keys
+  keys = key_map.keys.sort
+
+  # Go through sorted keys grabbing numbers from key_map until we have enough
+  num_found = 0
+  answer_array = []
+  until num_found >= k
+    num = keys.pop
+    found_nums = key_map[num]
+    num_found += found_nums.length
+    found_nums.each do |num|
+      answer_array.push(num)
+    end
+  end
+
+  # Cut off excess numbers
+  return answer_array[0..k-1]
 end