Add solution #1758

JoshCrozier · JoshCrozier · commit efd66fff11d4 · 2025-04-28T21:35:39.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,523 LeetCode solutions in JavaScript
+# 1,524 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1353,6 +1353,7 @@
 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|
 1755|[Closest Subsequence Sum](./solutions/1755-closest-subsequence-sum.js)|Hard|
+1758|[Minimum Changes To Make Alternating Binary String](./solutions/1758-minimum-changes-to-make-alternating-binary-string.js)|Easy|
 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|
diff --git a/solutions/1758-minimum-changes-to-make-alternating-binary-string.js b/solutions/1758-minimum-changes-to-make-alternating-binary-string.js
@@ -0,0 +1,31 @@
+/**
+ * 1758. Minimum Changes To Make Alternating Binary String
+ * https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/
+ * Difficulty: Easy
+ *
+ * You are given a string s consisting only of the characters '0' and '1'. In one operation, you can
+ * change any '0' to '1' or vice versa.
+ *
+ * The string is called alternating if no two adjacent characters are equal. For example, the string
+ * "010" is alternating, while the string "0100" is not.
+ *
+ * Return the minimum number of operations needed to make s alternating.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minOperations = function(s) {
+  let changesToZeroStart = 0;
+  let changesToOneStart = 0;
+
+  for (let i = 0; i < s.length; i++) {
+    const expectedZeroStart = i % 2 === 0 ? '0' : '1';
+    const expectedOneStart = i % 2 === 0 ? '1' : '0';
+    if (s[i] !== expectedZeroStart) changesToZeroStart++;
+    if (s[i] !== expectedOneStart) changesToOneStart++;
+  }
+
+  return Math.min(changesToZeroStart, changesToOneStart);
+};
