✨ [394] FIrst attempt - PASSED

Author: enkr1

394/my_solution.js

@@ -3,5 +3,85 @@
  * @return {string}
  */
 const decodeString = (s) => {
+  s = s.split("");
+  let stack = [], result = null;
+  console.log(`input: ${s}`);
+  for (let i = 0; i < s.length; i++) {
+    if ("]" === s[i]) {
+      console.log(`HIT! ] at ${i}`)
+      console.log(s)
+      stack = popToOpen(stack, stack.length - 1, [])
+      // result.push()
+      console.log(">>>>>> final stack returned")
+      console.log(stack)
+    } else {
+      stack.push(s[i])
+    }
 
+  }
+
+  console.log("stack")
+  console.log(stack.join())
+  console.log(stack.join(""))
 };
+const popToOpen = (stack, popNb, tmp) => {
+  console.log(`-> popToOpen - popNb - ${popNb} - stack[i] - ${stack[popNb]}`)
+
+  if (0 > popNb) return stack;
+
+  if ("[" === stack[popNb]) {
+    stack.pop(); // Remove "["
+    let multiplier = [];
+    console.log("KLQWKLJELKJWLJKWQELKJEQWLKJQWELKJLKJWQELJKQWELKJW")
+    console.log(stack)
+
+    let l = stack.length - 1;
+
+    for (let j = l; j >= 0; j--) {
+      console.log(`---> in J loop - ${j}`)
+
+      let maybeNb = parseInt(stack[j]);
+      // because the numebr will never be 0 so we can use parseInt
+      if (!maybeNb && 0 !== maybeNb) {
+        console.log("NOT AN INT BYEEE")
+        console.log(stack[j])
+        break;
+      }
+
+      console.log("stack[j]")
+      console.log(stack[j])
+      multiplier = [...stack[j], ...multiplier];
+      stack.pop();
+    }
+
+    console.log("---> multiplier")
+    console.log(multiplier)
+    console.log(parseInt(multiplier.join()))
+    console.log("tmp")
+    console.log(tmp)
+
+    multiplier = parseInt(multiplier.join(""));
+
+    tmp = tmp.join("").repeat(multiplier).split("")
+    return [...stack, ...tmp];
+  }
+
+  // tmp = [stack.pop(), ...[...tmp, stack[i]]];
+  console.log("--before tmp")
+  console.log(tmp)
+  tmp = [...stack.pop(), ...tmp];
+
+  console.log("--- AFTER POP")
+  console.log(stack)
+  console.log(tmp)
+
+  return popToOpen(stack, popNb - 1, tmp)
+}
+
+// 14
+// decodeString("ww3[aaa2[abac]]2[a]a")
+// decodeString("2[asd]3[q]")
+// decodeString("2[asdww]")
+// decodeString("qq3[w]x")
+decodeString("33[w]z")
+decodeString("100[leetcode]")

394/solution.js

@@ -0,0 +1,42 @@
+/**
+ * @param {string} s
+ * @return {string}
+ */
+const decodeString = (s) => {
+  s = s.split("");
+  let stack = [];
+
+  for (let i = 0; i < s.length; i++) {
+    if ("]" === s[i]) {
+      stack = popToOpen(stack, stack.length - 1, [])
+    } else {
+      stack.push(s[i])
+    }
+  }
+
+  return stack.join("");
+};
+
+const popToOpen = (stack, popNb, tmp) => {
+  if (0 > popNb) return stack;
+
+  if ("[" === stack[popNb]) {
+    stack.pop();
+    let multiplier = [], l = stack.length - 1;
+
+    for (let j = l; j >= 0; j--) {
+
+      // because the numebr will never be 0 so we can use parseInt
+      if (!parseInt(stack[j]) && 0 !== parseInt(stack[j])) break;
+
+      multiplier = [...stack[j], ...multiplier];
+      stack.pop();
+    }
+
+    return [...stack, ...tmp.join("").repeat(parseInt(multiplier.join(""))).split("")];
+  }
+
+  tmp = [...stack.pop(), ...tmp];
+
+  return popToOpen(stack, popNb - 1, tmp)
+}