Practice
/

Maximum Product Subarray

Maximum Product Subarray

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

Premium Content

Create a free account, then unlock this problem and the entire premium catalog with a one-time CodeSnatch Premium purchase.

Already have an account with premium access? Sign in to continue.