Maximum Product Subarray — Medium Coding Interview Question

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

Example

Input: nums = [2,3,-2,4]

Output: 6

Explanation: [2,3] has the largest product 6.

Constraints

• 1 <= nums.length <= 2 * 10^4
• -10 <= nums[i] <= 10

Topics & Companies

Topics: arrays, dp

Asked by: Amazon, Google, Microsoft

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns