Maximum Product Subarray
Try to solve the Maximum Product Subarray problem.
We'll cover the following
Statement
Given an integer array, nums
, find a subarray that has the largest product, and return the product.
Constraints:
nums.length
nums[i]
The product of any prefix or suffix ofÂ
nums
 is guaranteed to fit in a integer.
Example
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy