Search topics...

Maximum Product Subarray

medium
arrayTime: O(n)Space: O(1)Frequency: 4

Given an integer array, find the contiguous subarray that has the largest product.

Example 1:

Input: nums = [2, 3, -2, 4]
Output: 6
Explanation: [2, 3] has the largest product = 6.

Example 2:

Input: nums = [-2, 0, -1]
Output: 0
Explanation: The maximum product subarray is [0].