Add solution #926

Author: JoshCrozier

README.md

@@ -208,6 +208,7 @@
 916|[Word Subsets](./0916-word-subsets.js)|Medium|
 922|[Sort Array By Parity II](./0922-sort-array-by-parity-ii.js)|Easy|
 925|[Long Pressed Name](./0925-long-pressed-name.js)|Easy|
+926|[Flip String to Monotone Increasing](./0926-flip-string-to-monotone-increasing.js)|Medium|
 929|[Unique Email Addresses](./0929-unique-email-addresses.js)|Easy|
 966|[Vowel Spellchecker](./0966-vowel-spellchecker.js)|Medium|
 970|[Powerful Integers](./0970-powerful-integers.js)|Easy|

solutions/0926-flip-string-to-monotone-increasing.js

@@ -0,0 +1,33 @@
+/**
+ * 926. Flip String to Monotone Increasing
+ * https://leetcode.com/problems/flip-string-to-monotone-increasing/
+ * Difficulty: Medium
+ *
+ * A binary string is monotone increasing if it consists of some number of 0's
+ * (possibly none), followed by some number of 1's (also possibly none).
+ *
+ * You are given a binary string s. You can flip s[i] changing it from 0 to 1
+ * or from 1 to 0.
+ *
+ * Return the minimum number of flips to make s monotone increasing.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minFlipsMonoIncr = function(s) {
+  let result = 0;
+  let count = 0;
+
+  for (const str of s) {
+    if (str == '1') {
+      count++;
+    } else if (str =='0' && count > 0) {
+      result++;
+      count--;
+    }
+  }
+
+  return result;
+};