Problem

Submissions

Problem: Maximum Product Subarray

Statement

Given an integer array, nums, find a subarray that has the largest product, and return the product.

Constraints:

$1\leq$ nums.length $\leq 10^3$
$-10\leq$ nums[i] $\leq 10$
The product of any prefix or suffix of nums is guaranteed to fit in a $32-bit$ integer.

Example

Problem

Submissions

Problem: Maximum Product Subarray

Statement

Given an integer array, nums, find a subarray that has the largest product, and return the product.

Constraints:

$1\leq$ nums.length $\leq 10^3$
$-10\leq$ nums[i] $\leq 10$
The product of any prefix or suffix of nums is guaranteed to fit in a $32-bit$ integer.

Example