Maximum Product Subarray

Try to solve the Maximum Product Subarray problem.

Statement

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

Constraints:

  • 1≤1\leqnums.length ≤103\leq10^3

  • −10≤-10 \leqnums[i] ≤10\leq 10

  • The product of any prefix or suffix of nums is guaranteed to fit in a 32−bit32-bit integer.

Example

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy