Add solution #1702

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,486 LeetCode solutions in JavaScript
+# 1,487 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1311,6 +1311,7 @@
 1697|[Checking Existence of Edge Length Limited Paths](./solutions/1697-checking-existence-of-edge-length-limited-paths.js)|Hard|
 1700|[Number of Students Unable to Eat Lunch](./solutions/1700-number-of-students-unable-to-eat-lunch.js)|Easy|
 1701|[Average Waiting Time](./solutions/1701-average-waiting-time.js)|Medium|
+1702|[Maximum Binary String After Change](./solutions/1702-maximum-binary-string-after-change.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|

solutions/1702-maximum-binary-string-after-change.js

@@ -0,0 +1,40 @@
+/**
+ * 1702. Maximum Binary String After Change
+ * https://leetcode.com/problems/maximum-binary-string-after-change/
+ * Difficulty: Medium
+ *
+ * You are given a binary string binary consisting of only 0's or 1's. You can apply each of
+ * the following operations any number of times:
+ * - Operation 1: If the number contains the substring "00", you can replace it with "10".
+ *   - For example, "00010" -> "10010"
+ * - Operation 2: If the number contains the substring "10", you can replace it with "01".
+ *   - For example, "00010" -> "00001"
+ *
+ * Return the maximum binary string you can obtain after any number of operations. Binary
+ * string x is greater than binary string y if x's decimal representation is greater than
+ * y's decimal representation.
+ */
+
+/**
+ * @param {string} binary
+ * @return {string}
+ */
+var maximumBinaryString = function(binary) {
+  const n = binary.length;
+  let zeroCount = 0;
+  let firstZero = -1;
+
+  for (let i = 0; i < n; i++) {
+    if (binary[i] === '0') {
+      if (firstZero === -1) firstZero = i;
+      zeroCount++;
+    }
+  }
+
+  if (zeroCount <= 1) return binary;
+
+  const result = new Array(n).fill('1');
+  result[firstZero + zeroCount - 1] = '0';
+
+  return result.join('');
+};