Maximum Product Subarray

1Medium

Maximum Product Subarray

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

Example 1:

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

Example 2:

Input: nums = [-2,0,-1] Output: 0

Example 3:

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

Jnaneshwara Reddy Satti

Builder · ClearCode

Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕

If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.

Support via Razorpay

Found this helpful? Support ClearCode ☕ — keeps it free forever

Algorithm Visualizer

O(N)

Initializing...

TEST CASE: []O(1)

clearcode.in

Execution Trace

1def maxProduct(nums):

2 if not nums:

3 return 0

5 max_product = min_product = result = nums[0]

7 for i in range(1, len(nums)):

8 if nums[i] < 0:

9 max_product, min_product = min_product, max_product

11 max_product = max(nums[i], max_product * nums[i])

12 min_product = min(nums[i], min_product * nums[i])

14 result = max(result, max_product)

16 return result

0:00 / 0:10

Maximum Product Subarray — Medium 1-D Dynamic Programming Algorithm | ClearCode