Add solution #1653

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,451 LeetCode solutions in JavaScript
+# 1,452 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1273,6 +1273,7 @@
 1648|[Sell Diminishing-Valued Colored Balls](./solutions/1648-sell-diminishing-valued-colored-balls.js)|Medium|
 1649|[Create Sorted Array through Instructions](./solutions/1649-create-sorted-array-through-instructions.js)|Hard|
 1652|[Defuse the Bomb](./solutions/1652-defuse-the-bomb.js)|Easy|
+1653|[Minimum Deletions to Make String Balanced](./solutions/1653-minimum-deletions-to-make-string-balanced.js)|Medium|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1653-minimum-deletions-to-make-string-balanced.js

@@ -0,0 +1,34 @@
+/**
+ * 1653. Minimum Deletions to Make String Balanced
+ * https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/
+ * Difficulty: Medium
+ *
+ * You are given a string s consisting only of characters 'a' and 'b'.
+ *
+ * You can delete any number of characters in s to make s balanced. s is balanced if there is
+ * no pair of indices (i,j) such that i < j and s[i] = 'b' and s[j]= 'a'.
+ *
+ * Return the minimum number of deletions needed to make s balanced.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minimumDeletions = function(s) {
+  let aCountRight = 0;
+  for (const char of s) {
+    if (char === 'a') aCountRight++;
+  }
+
+  let bCountLeft = 0;
+  let result = aCountRight;
+
+  for (const char of s) {
+    if (char === 'a') aCountRight--;
+    else bCountLeft++;
+    result = Math.min(result, aCountRight + bCountLeft);
+  }
+
+  return result;
+};