✨ [1768] a1

Author: enkr1

1768/my_solution.js

@@ -0,0 +1,30 @@
+/**
+ * @param {string} word1
+ * @param {string} word2
+ * @return {string}
+ */
+var mergeAlternately = function (word1, word2) {
+  let str = "";
+  word1 = word1.split(""), word2 = word2.split("");
+  while (word1.length > 0 || word2.length > 0) {
+    let curr1 = "", curr2 = "";
+    console.log(word1)
+    console.log(word2)
+    if (word1.length > 0) {
+      curr1 = word1.shift();
+    }
+
+    if (word2.length > 0) {
+      curr2 = word2.shift();
+    }
+
+    str += curr1 + curr2;
+  }
+
+  return str;
+};
+let x =
+  mergeAlternately("abc", "pqr")
+
+console.log("Res")
+console.log(x)

1768/solution.js

@@ -0,0 +1,25 @@
+/**
+ * @param {string} word1
+ * @param {string} word2
+ * @return {string}
+ */
+var mergeAlternately = function (word1, word2) {
+  let str = "";
+  word1 = word1.split(""), word2 = word2.split("");
+  while (word1.length > 0 || word2.length > 0) {
+    let curr1 = "", curr2 = "";
+    console.log(word1)
+    console.log(word2)
+    if (word1.length > 0) {
+      curr1 = word1.shift();
+    }
+
+    if (word2.length > 0) {
+      curr2 = word2.shift();
+    }
+
+    str += curr1 + curr2;
+  }
+
+  return str;
+};

README.md

@@ -98,6 +98,7 @@
 - [1569. Number of Ways to Reorder Array to Get Same BST](./1569/)
 - [1572. Matrix Diagonal Sum](./1572/)
 - [1672. Richest Customer Wealth](./1672/)
+- [1768. Merge Strings Alternately](./1768/)
 - [1791. Find Center of Star Graph](./1791/)
 - [1909. Remove One Element to Make the Array Strictly Increasing](./1909/)
 - [1971. Find if Path Exists in Graph](./1971/)
@@ -151,7 +152,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=212 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=1768 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.