❌ [49] TLE

Author: enkr1

49/my_solution.js

@@ -8,24 +8,45 @@
 
 // ["a"]
 // [["a"]]
-
+/**
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
 const groupAnagrams = (list) => {
   // result,
   // shift -> for i & k=i+1
   // twice isAnagram just to check
   // if we find one -> splice(index, 1)
   // -> group.push(item) // until the end of the list
   // until []
-  processWords(list, [], []);
+  // let x = processWords(list, []);
+  // console.log("x")
+  // console.log(x)
+  return processWords(list, []);
 }
 
 const areTheyAnagrams = (word1, word2) => {
-  if (undefined === word2) return false;
+  console.log(">>>")
+  console.log(word1 || "0")
+  console.log(word2)
+  console.log("<<<")
+  let char1 = (word1 || "0").split(""),
+    char2 = (word2 || "0").split("");
+
+  if (undefined === word2 || (word1 && word2 && (word1.length !== word2.length))) return false;
+
+
+  let map1 = createAnagramMap(char1), map2 = createAnagramMap(char2);
+  console.log("map1:map2")
+  console.log(map1)
+  console.log(map2)
+
 
-  let char = word1.split(""), map1 = createAnagramMap(char), map2 = createAnagramMap(word2.split(""));
   // {“e” => 1, “a” => 1, “t” => 1}
-  for (let i = 0; i < char.length; i++) {
-    if (map1.get(char[i]) !== map2.get(char[i])) return false;
+  for (let i = 0; i < char1.length; i++) {
+    console.log(">>")
+    console.log(map1.get(char1[i]) !== map2.get(char1[i]))
+    if (map1.get(char1[i]) !== map2.get(char1[i])) return false;
   }
 
   return true;
@@ -41,26 +62,60 @@ const createAnagramMap = (char) => {
   return map;
 }
 
-const processWords = (list, groupList, group) => {
-  if ([] === list) {
+const processWords = (list, groupList) => {
+  if (0 === list.length) {
     return groupList;
   }
 
-  let curr = list.shift(); //  ["eat","tea","tan","ate","nat","bat"] ->  ["tea","tan","ate","nat","bat"]
-  let tmpList = list;
+  console.log("check")
+  console.log(list)
+  // console.log(list.length)
+  // console.log(groupList)
+  // console.log(group)
 
-  while ([] !== list) {
+  //  ["eat","tea","tan","ate","nat","bat"] ->  ["tea","tan","ate","nat","bat"]
+  let curr = list.shift(), tmpList = [...list], group = [];
+  group.push(curr);
+
+  while (0 < list.length) {
     let next = list.shift();
-    if (areTheyAnagrams(curr, next)) group.push(next);
+    console.log(`=> comparing ${curr}:${next}`)
+
+    if (areTheyAnagrams(curr, next)) {
+      console.log("they are")
+      group.push(next);
+    }
   }
 
-  // remove from tmpList that are added into the group
-  tmpList.filter((item) => {
-    return !group.includes(item);
+  console.log("=> group")
+  console.log(group)
+  // console.log("-> tmpList")
+  // console.log(tmpList)
+
+  // Remove from tmpList that are added into the group
+  tmpList = tmpList.filter((elem) => {
+    return !group.includes(elem);
   })
 
+  // console.log("tmpList <-")
+  // console.log(tmpList)
+
   // process for groupList
   groupList.push(group);
+  console.log("groupList")
+  console.log(groupList)
 
-  return processWords(tmpList, groupList, group);
+  return processWords(tmpList, groupList);
 }
+
+let x =
+  // groupAnagrams(["eat", "tea", "tan", "ate", "nat", "bat"])
+  // groupAnagrams(["", "b"])
+  // groupAnagrams(["", ""])
+  groupAnagrams(["tea", "and", "ace", "ad", "eat", "dans"])
+// groupAnagrams([""])
+// groupAnagrams(["a"])
+// groupAnagrams([])
+
+console.log(">>")
+console.log(x)

49/solution.js

@@ -0,0 +1,69 @@
+/**
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
+const groupAnagrams = (list) => {
+  // result,
+  // shift -> for i & k=i+1
+  // twice isAnagram just to check
+  // if we find one -> splice(index, 1)
+  // -> group.push(item) // until the end of the list
+  // until []
+  // let x = processWords(list, []);
+  // console.log("x")
+  // console.log(x)
+  return processWords(list, []);
+}
+
+const areTheyAnagrams = (word1, word2) => {
+  let char1 = (word1 || "0").split(""),
+    char2 = (word2 || "0").split("");
+
+  if (undefined === word2 || (word1 && word2 && (word1.length !== word2.length))) return false;
+
+
+  let map1 = createAnagramMap(char1), map2 = createAnagramMap(char2);
+
+  for (let i = 0; i < char1.length; i++) {
+    if (map1.get(char1[i]) !== map2.get(char1[i])) return false;
+  }
+
+  return true;
+}
+
+const createAnagramMap = (char) => {
+  let map = new Map();
+
+  for (let i = 0; i < char.length; i++) {
+    map.set(char[i], (map.has(char[i]) ? (map.get(char[i]) + 1) : 1))
+  }
+
+  return map;
+}
+
+const processWords = (list, groupList) => {
+  if (0 === list.length) {
+    return groupList;
+  }
+
+  let curr = list.shift(), tmpList = [...list], group = [];
+  group.push(curr);
+
+  while (0 < list.length) {
+    let next = list.shift();
+
+    if (areTheyAnagrams(curr, next)) {
+      group.push(next);
+    }
+  }
+
+  // Remove from tmpList that are added into the group
+  tmpList = tmpList.filter((elem) => {
+    return !group.includes(elem);
+  })
+
+  // process for groupList
+  groupList.push(group);
+
+  return processWords(tmpList, groupList);
+}