Add solution #1754

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,521 LeetCode solutions in JavaScript
+# 1,522 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1351,6 +1351,7 @@
 1751|[Maximum Number of Events That Can Be Attended II](./solutions/1751-maximum-number-of-events-that-can-be-attended-ii.js)|Hard|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.js)|Easy|
 1753|[Maximum Score From Removing Stones](./solutions/1753-maximum-score-from-removing-stones.js)|Medium|
+1754|[Largest Merge Of Two Strings](./solutions/1754-largest-merge-of-two-strings.js)|Medium|
 1764|[Form Array by Concatenating Subarrays of Another Array](./solutions/1764-form-array-by-concatenating-subarrays-of-another-array.js)|Medium|
 1765|[Map of Highest Peak](./solutions/1765-map-of-highest-peak.js)|Medium|
 1768|[Merge Strings Alternately](./solutions/1768-merge-strings-alternately.js)|Easy|

solutions/1754-largest-merge-of-two-strings.js

@@ -0,0 +1,44 @@
+/**
+ * 1754. Largest Merge Of Two Strings
+ * https://leetcode.com/problems/largest-merge-of-two-strings/
+ * Difficulty: Medium
+ *
+ * You are given two strings word1 and word2. You want to construct a string merge in the
+ * following way: while either word1 or word2 are non-empty, choose one of the following
+ * options:
+ * - If word1 is non-empty, append the first character in word1 to merge and delete it from word1.
+ *   - For example, if word1 = "abc" and merge = "dv", then after choosing this operation,
+ *     word1 = "bc" and merge = "dva".
+ * - If word2 is non-empty, append the first character in word2 to merge and delete it from word2.
+ *   - For example, if word2 = "abc" and merge = "", then after choosing this operation,
+ *     word2 = "bc" and merge = "a".
+ *
+ * Return the lexicographically largest merge you can construct.
+ *
+ * A string a is lexicographically larger than a string b (of the same length) if in the first
+ * position where a and b differ, a has a character strictly larger than the corresponding
+ * character in b. For example, "abcd" is lexicographically larger than "abcc" because the
+ * first position they differ is at the fourth character, and d is greater than c.
+ */
+
+/**
+ * @param {string} word1
+ * @param {string} word2
+ * @return {string}
+ */
+var largestMerge = function(word1, word2) {
+  let merge = '';
+  let i = 0;
+  let j = 0;
+
+  while (i < word1.length && j < word2.length) {
+    if (word1.slice(i) >= word2.slice(j)) {
+      merge += word1[i++];
+    } else {
+      merge += word2[j++];
+    }
+  }
+
+  merge += word1.slice(i) + word2.slice(j);
+  return merge;
+};