How should I practice Maximum Product Subarray?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Maximum Product Subarray associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Maximum Product Subarray

Google● MediumINTERNONSITE INTERVIEW

Learn

Problem statement

Given an integer array nums, return the largest product of any non-empty contiguous subarray.

Function

maxProduct(nums: int[]) → int

Examples

Example 1

nums = [2,3,-2,4]return = 6

The contiguous subarray [2,3] has product 6.

Example 2

nums = [-2,0,-1]return = 0

The two negative values are separated by 0, so they cannot belong to the same contiguous subarray.

Example 3

nums = [-2,3,-4]return = 24

The entire array has product 24.

Constraints

1 <= nums.length <= 20000.
-10 <= nums[i] <= 10.
The product of every contiguous subarray fits in a signed 32-bit integer.