Maximum Product Subarray | Dataford Interview Questions

Given an array of integers, find the contiguous subarray that has the largest product and return that product.

Implement max_product_subarray(nums). The input is a non-empty list of integers, and the output is a single integer. Account for positive values, negative values, and zeros.

Constraints

1 <= nums.length <= 1000
-10 <= nums[i] <= 10
The input array is non-empty
The answer fits within the supported integer range

Function Signature

def max_product_subarray(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

Given an array of integers, find the contiguous subarray that has the largest product and return that product.

Implement max_product_subarray(nums). The input is a non-empty list of integers, and the output is a single integer. Account for positive values, negative values, and zeros.

Constraints

1 <= nums.length <= 1000
-10 <= nums[i] <= 10
The input array is non-empty
The answer fits within the supported integer range

Function Signature

def max_product_subarray(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.