Leetcode•Oct 29, 2026
Maximum Length of Subarray With Positive Product
Hazrat Ali
Leetcode
A subarray of an array is a consecutive sequence of zero or more values taken out of that array.
Return the maximum length of a subarray with positive product.
Example 1:
Input: nums = [1,-2,-3,4] Output: 4 Explanation: The array nums already has a positive product of 24.
Example 2:
Input: nums = [0,1,-2,-3,-4] Output: 3 Explanation: The longest subarray with positive product is [1,-2,-3] which has a product of 6. Notice that we cannot include 0 in the subarray since that'll make the product 0 which is not positive.
Example 3:
Input: nums = [-1,-2,-3,0,1] Output: 2 Explanation: The longest subarray with positive product is [-1,-2] or [-2,-3].
Solution
var getMaxLen = function(nums) {
let positive = 0;
let negative = 0;
let maxLength = 0;
for (const num of nums) {
if (num === 0) {
positive = 0;
negative = 0;
} else if (num > 0) {
positive++;
if (negative > 0) {
negative++;
}
} else {
const temp = positive;
positive = negative > 0 ? negative + 1 : 0;
negative = temp + 1;
}
maxLength = Math.max(maxLength, positive);
}
return maxLength;
};