Shamira

lib/exercises.js

@@ -1,11 +1,30 @@
 // 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 ^ 2) since the array being sorted has a length less than 10, the sort() method uses InsertionSort.
+// If the array.length was greater than 10, QuickSort would be implemented and the time complexity would be O(nlog(n)) because I have to loop through the array to put it in the hash table.
+// Source: https://blog.shovonhasan.com/time-space-complexity-of-array-sort-in-v8/
+// Space Complexity: O(n), with n being the number of strings in the array.
 function grouped_anagrams(strings) {
-  throw new Error("Method hasn't been implemented yet!");
+  if (strings.length === 0) {
+    return []
+  }
+ const words_hash = {};
+
+ strings.forEach((word) => {
+   // alphabetize word
+   const sorted_word = word.split('').sort().join();
+   if (words_hash[sorted_word]) {
+     words_hash[sorted_word].push(word);
+   } else {
+     words_hash[sorted_word] = [word];
+   }
+ })
+
+ return Object.values(words_hash);
+
 }
 
+
 // This method will return the k most common elements
 // in the case of a tie it will select the first occuring element.
 // Time Complexity: ?