Kayla - 🌊

lib/exercises.js

@@ -3,15 +3,56 @@
 // Time Complexity: ?
 // Space Complexity: ?
 function grouped_anagrams(strings) {
-  throw new Error("Method hasn't been implemented yet!");
+
+  if (!strings.length) {
+    return []
+  }
+
+let anagrams = {}
+
+for (const string of strings) {
+  const sortedString = string.split("").sort().join("");
+  // console.log(sortedString)
+
+  if(anagrams[sortedString]) {
+    // console.log(anagrams[sortedString])
+    anagrams[sortedString].push(string) 
+
+  }else {
+    anagrams[sortedString] = [string];
+  }
+}
+return Object.values(anagrams)
+
+
+
+
 }
 
 // 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: ?
 function top_k_frequent_elements(list, k) {
-  throw new Error("Method hasn't been implemented yet!");
+if (!list.length) return []
+
+  let numbersCount = {}
+
+  for (const num of list) {
+    numbersCount[num] = numbersCount[num] ? numbersCount[num] + 1 : 1;
+  }
+  console.log(numbersCount)
+
+  let topFrequentElements = []
+
+  const valuesList = Object.keys(numbersCount).sort((num1, num2) => numbersCount[num2] - numbersCount[num1]);
+
+  for (let i = 0; i < k; i++) {
+    topFrequentElements.push(parseInt(valuesList[i]))
+  }
+
+  return topFrequentElements
+
 }