Day72

swolecoder · swolecoder · commit e01fdac691e0 · 2020-12-20T11:22:32.000-05:00
diff --git a/Day71/index.js b/Day71/index.js
@@ -0,0 +1,43 @@
+/**
+ * @param {string} number
+ * @return {string}
+ */
+var reformatNumber = function (number) {
+    let num = number.split("").filter((d) => d != "-" && d != " ");
+    let result = [];
+
+    if (num.length <= 3) return num.join("")
+
+    let len = num.length;
+    let res = [];
+
+    for (let i = 0; i < num.length; i++) {
+
+        if (i + 4 >= len) {
+            console.log("Ashish", num.slice(i, i + 4))
+
+            let len = num.slice(i, i + 4).length;
+
+            if (len <= 3) {
+                res.push(num.slice(i, i + 4).join(""));
+                break
+            }
+
+
+
+            if (len == 4) {
+                res.push(num.slice(i, i + 2).join(""));
+                res.push(num.slice(i + 2).join(""));
+                break
+            }
+
+
+        } else {
+            res.push(num.slice(i, i + 3).join(""));
+            i += 2
+        }
+
+    }
+    console.log(res)
+    return res.join("-")
+};
diff --git a/Day72/index.js b/Day72/index.js
@@ -0,0 +1,33 @@
+/**
+ * @param {string} S
+ * @param {number} K
+ * @return {string}
+ */
+var decodeAtIndex = function (S, K) {
+
+
+    let size = 0;
+
+    for (let i = 0; i < S.length; i++) {
+
+        if (!isNaN(S[i])) {
+            size *= Number(S[i])
+        } else {
+            size++
+        }
+    }
+
+
+    for (let i = S.length - 1; i >= 0; i--) {
+        K = K % size;
+        if (K == 0 && isNaN(S[i])) {
+            return S[i]
+        }
+        if (!isNaN(S[i])) {
+            size = Math.ceil(size / Number(S[i]))
+        } else {
+            size--;
+        }
+
+    }
+};
diff --git a/README.md b/README.md
@@ -158,4 +158,8 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 69| [334. Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [javascript]()|[:memo:](https://leetcode.com/problems/increasing-triplet-subsequence/)|Medium|
 
-|Day 70| [1463. Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/submissions/) | [javascript]()|[:memo:](https://leetcode.com/problems/cherry-pickup-ii/submissions/)|Hard|
+|Day 70| [1463. Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/submissions/) | [javascript]()|[:memo:](https://leetcode.com/problems/cherry-pickup-ii/submissions/)|Hard|
+
+|Day 71| [1694. Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/) | [javascript]()|[:memo:](https://leetcode.com/problems/reformat-phone-number/)|Easy|
+
+|Day 72| [880. Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/) | [javascript]()|[:memo:](https://leetcode.com/problems/decoded-string-at-index/)|Easy|
