Maximum Product Subarray | Dataford Interview Questions

Solve the maximum product subarray problem and explain how you handle negatives and zeros.

Implement the function below for a non-empty integer array. Return the largest product of any contiguous, non-empty subarray, including single-element subarrays. Explain why both the maximum and minimum products ending at each position must be tracked.

Constraints

1 <= nums.length <= 1000
-10 <= nums[i] <= 10
The subarray must be contiguous and non-empty

Function Signature

def max_product(nums):

Your question is Maximum Product Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve the maximum product subarray problem and explain how you handle negatives and zeros.

Constraints

1 <= nums.length <= 1000
-10 <= nums[i] <= 10
The subarray must be contiguous and non-empty

Function Signature

def max_product(nums):

Your question is Maximum Product Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.