Add solution #3223

Author: JoshCrozier

README.md

@@ -442,6 +442,7 @@
 2724|[Sort By](./2724-sort-by.js)|Easy|
 3042|[Count Prefix and Suffix Pairs I](./3042-count-prefix-and-suffix-pairs-i.js)|Easy|
 3110|[Score of a String](./3110-score-of-a-string.js)|Easy|
+3223|[Minimum Length of String After Operations](./3223-minimum-length-of-string-after-operations.js)|Medium|
 3392|[Count Subarrays of Length Three With a Condition](./3392-count-subarrays-of-length-three-with-a-condition.js)|Easy|
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
 3397|[Maximum Number of Distinct Elements After Operations](./3397-maximum-number-of-distinct-elements-after-operations.js)|Medium|

solutions/3223-minimum-length-of-string-after-operations.js

@@ -0,0 +1,29 @@
+/**
+ * 3223. Minimum Length of String After Operations
+ * https://leetcode.com/problems/minimum-length-of-string-after-operations/
+ * Difficulty: Medium
+ *
+ * You are given a string s.
+ *
+ * You can perform the following process on s any number of times:
+ * - Choose an index i in the string such that there is at least one character to the left of
+ *   index i that is equal to s[i], and at least one character to the right that is also equal
+ *   to s[i].
+ * - Delete the closest character to the left of index i that is equal to s[i].
+ * - Delete the closest character to the right of index i that is equal to s[i].
+ *
+ * Return the minimum length of the final string s that you can achieve.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minimumLength = function(s) {
+  if (s.length < 3) return s.length;
+
+  const map = new Map();
+  s.split('').forEach(c => map.set(c, (map.get(c) ?? 0) + 1));
+
+  return [...map.values()].reduce((count, n) => count + (n % 2 ? n % 2 : 2), 0);
+};