Add solution #1750

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,518 LeetCode solutions in JavaScript
+# 1,519 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1347,6 +1347,7 @@
 1745|[Palindrome Partitioning IV](./solutions/1745-palindrome-partitioning-iv.js)|Hard|
 1748|[Sum of Unique Elements](./solutions/1748-sum-of-unique-elements.js)|Easy|
 1749|[Maximum Absolute Sum of Any Subarray](./solutions/1749-maximum-absolute-sum-of-any-subarray.js)|Medium|
+1750|[Minimum Length of String After Deleting Similar Ends](./solutions/1750-minimum-length-of-string-after-deleting-similar-ends.js)|Medium|
 1752|[Check if Array Is Sorted and Rotated](./solutions/1752-check-if-array-is-sorted-and-rotated.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|

solutions/1750-minimum-length-of-string-after-deleting-similar-ends.js

@@ -0,0 +1,33 @@
+/**
+ * 1750. Minimum Length of String After Deleting Similar Ends
+ * https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/
+ * Difficulty: Medium
+ *
+ * Given a string s consisting only of characters 'a', 'b', and 'c'. You are asked to apply the
+ * following algorithm on the string any number of times:
+ * 1. Pick a non-empty prefix from the string s where all the characters in the prefix are equal.
+ * 2. Pick a non-empty suffix from the string s where all the characters in this suffix are equal.
+ * 3. The prefix and the suffix should not intersect at any index.
+ * 4. The characters from the prefix and suffix must be the same.
+ * 5. Delete both the prefix and the suffix.
+ *
+ * Return the minimum length of s after performing the above operation any number of times
+ * (possibly zero times).
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minimumLength = function(s) {
+  let left = 0;
+  let right = s.length - 1;
+
+  while (left < right && s[left] === s[right]) {
+    const char = s[left];
+    while (left <= right && s[left] === char) left++;
+    while (left <= right && s[right] === char) right--;
+  }
+
+  return Math.max(0, right - left + 1);
+};