Maximum Product Subarray

Posted: 1 Feb, 2021
Difficulty: Moderate


Try Problem

You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report this maximum product.

An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.

For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3]. 
For Example:
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Follow Up:
Can you solve this in linear time and constant space complexity?
Input format:
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then, the T test cases follow.
The first line of each test case contains a single integer N, denoting the number of elements of the array “arr”.
The second line of each test case contains N space separated integers denoting the elements of the array “arr”.
Output format:
For each test case, print the maximum product of the contiguous non-empty subarray of the array “arr”.

Output for each test case will be printed in a separate line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= N <= 5000
-100 <= arr[i] <= 100
where N is the size of the array “arr”.

Time limit: 1 second
Approach 1


  1. Create an ans variable and initialize it to INT_MIN.
  2. Run a loop i = 0 to N and do:
    • Run a loop j = i to N and do:
      • Create a variable, say currentProduct and initialize it to 1.
      • Run a loop k = i to j and do:
        • currentProduct = currentProduct * arr[k]
        • Store the maximum of ans and the currentProduct in the ans variable.
  3. Finally, return the ans variable.
Try Problem