Add solution #1529

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,348 LeetCode solutions in JavaScript
+# 1,349 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1168,6 +1168,7 @@
 1525|[Number of Good Ways to Split a String](./solutions/1525-number-of-good-ways-to-split-a-string.js)|Medium|
 1526|[Minimum Number of Increments on Subarrays to Form a Target Array](./solutions/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.js)|Hard|
 1528|[Shuffle String](./solutions/1528-shuffle-string.js)|Easy|
+1529|[Minimum Suffix Flips](./solutions/1529-minimum-suffix-flips.js)|Medium|
 1534|[Count Good Triplets](./solutions/1534-count-good-triplets.js)|Easy|
 1535|[Find the Winner of an Array Game](./solutions/1535-find-the-winner-of-an-array-game.js)|Medium|
 1550|[Three Consecutive Odds](./solutions/1550-three-consecutive-odds.js)|Easy|

solutions/1529-minimum-suffix-flips.js

@@ -0,0 +1,31 @@
+/**
+ * 1529. Minimum Suffix Flips
+ * https://leetcode.com/problems/minimum-suffix-flips/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed binary string target of length n. You have another binary string s
+ * of length n that is initially set to all zeros. You want to make s equal to target.
+ *
+ * In one operation, you can pick an index i where 0 <= i < n and flip all bits in the inclusive
+ * range [i, n - 1]. Flip means changing '0' to '1' and '1' to '0'.
+ *
+ * Return the minimum number of operations needed to make s equal to target.
+ */
+
+/**
+ * @param {string} target
+ * @return {number}
+ */
+var minFlips = function(target) {
+  let current = '0';
+  let result = 0;
+
+  for (const bit of target) {
+    if (bit !== current) {
+      result++;
+      current = bit;
+    }
+  }
+
+  return result;
+};