Add solution #2529

Author: JoshCrozier

README.md

@@ -331,6 +331,7 @@
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|
 2482|[Difference Between Ones and Zeros in Row and Column](./2482-difference-between-ones-and-zeros-in-row-and-column.js)|Medium|
 2490|[Circular Sentence](./2490-circular-sentence.js)|Easy|
+2529|[Maximum Count of Positive Integer and Negative Integer](./2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 
 ## License
 

solutions/2529-maximum-count-of-positive-integer-and-negative-integer.js

@@ -0,0 +1,24 @@
+/**
+ * 2529. Maximum Count of Positive Integer and Negative Integer
+ * https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/
+ * Difficulty: Easy
+ *
+ * Given an array nums sorted in non-decreasing order, return the maximum
+ * between the number of positive integers and the number of negative integers.
+ *
+ * In other words, if the number of positive integers in nums is pos and the
+ * number of negative integers is neg, then return the maximum of pos and neg.
+ *
+ * Note that 0 is neither positive nor negative.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maximumCount = function(nums) {
+  const result = nums.reduce(([neg = 0, pos = 0], n) => {
+    return [neg + (n < 0 ? 1 : 0), pos + (n > 0 ? 1 : 0)];
+  }, []);
+  return Math.max(...result);
+};