Maximum Product Subarray Problem

Maximum Product Subarray Problem — ExecCode Easy DSA Practice

Solve the Maximum Product Subarray problem on ExecCode. Free online easy DSA practice in DP. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array nums, find a subarray that has the largest product, and return the product. Your task is to the test cases are generated so that the answer will fit in a 32-bit integer. Note that the product of an array with a single element is the value of that element. Return the required answer exactly as shown in the examples.

Examples

Input {"nums": [2, 3, -2, 4]}; Output 6. Input {"nums": [-2, 0, -1]}; Output 0. Input {"nums": [-2, 3, -4]}; Output 24

Constraints

1 <= nums.length <= 2 * 10^4 -10 <= nums[i] <= 10 The product of any subarray of nums is guaranteed to fit in a 32-bit integer.

Practice Maximum Product Subarray free on ExecCode. Browse DSA problems, topic map, and placement guides.