Maximum product subarray

Reverse Array
Pair Sum Equals Number
Floor and Ceil
Largest Sum Subarray
Missing Number
Odd Occuring Number
Sort by Frequency
First and Second Smallest
Majority Element
Difference between elements
Arrange Even and Odd
Closest Sum Elements
Distinct Elements
First Repeating Number
Common Elements in Arrays
Smallest Missing Number
Max Adjacent Sum
Find Occurrences of Number
Rotate Image
Distance Between Numbers
Pair with given difference
Product Array Puzzle
Replace Elements
First Repeating Element
Move Zeroes to End
Pythagorean Triplets
Maximum Average Subarray
Subarray Sum Equal to X
Leaders in Array
Largest Pair Sum
Segregate 0s 1s and 2s
Find Duplicates
Consecutive Elements Check
Triplet with given Sum
Binary Search in Sorted Array
Fixed point in sorted array
Reorder Elements by Indexes
Merging two sorted arrays
Find next greater number
Reorder array using given indexes
Count of triplets with sum less than given value
Merge two sorted arrays
Subarray and Subsequence
Rearrange array maximum minimum form
Find the lost element from a duplicated array
Count minimum steps to get the given array
Maximum element in an array which is increasing and then decreasing
Minimum number of jumps to reach the end of an array
Subarray with given sum
Length of Longest Increasing Subsequence
Smallest positive number missing unsorted array
The Celebrity Problem
Sorted subsequence of size 3
Partition Problem
Find pair with given difference
Maximum length of chain pairs
Four elements that sum to given
Maximum circular subarray sum
Count possible triangles
Longest Increasing Subsequence
Petrol Bunks Tour
Tug of War
Counting Sort
Maximum Repeating Number
Positive Negative Arrangement
Find a Peak element
Elements More Than n/k
Max Product Subsequence
Longest Bitonic subarray in an array
Number of smaller elements on right side
Implement two stacks in an array
Maximum sum increasing subsequence
Find the two numbers with odd occurrences in an unsorted array
Largest subarray with equal number of 0's and 1's
Maximum product subarray
Replace every element with the greatest on the right side in an array
Sorting a k sorted array
Find the row with maximum number of 1's
Shuffle a given array
Iterative Implementation of quick sort
Arrange given numbers to form the biggest number
Pancake sorting
Pancake sorting Problem
Maximum Subarray Sum using Divide and Conquer
Merge Overlapping Intervals
Stock Buy Sell to Maximize Profit
Sort Elements by frequency
Print all possible combinations of r elements in a given array of size n
Monotonically increasing function
Minimum element in a sorted and rotated array
Merge k Sorted Arrays
Flip Zeroes for Consecutive 1's
Least Average Subarray
Longest span with same sum in two binary arrays
Form minimum number from given sequence of D's and I's
Number of strictly increasing subarrays
Minimum difference between any two elements in an array
Number of pairs with given sum
Make Array Palindrome
Dynamic Programming, Longest Bitonic SubSequence

Given an array consisting of positive, negative integers and also zeroes, this function will find  the maxium product of the subarray.


arr[] = {3, -6, -1, 0, 4}

Maximum product is 18
Subarray {3, -6, -1} is having the maximum product

Time Complexity: O(n)

The main idea in this method is taking two variables localmin,  localmax and keep track of minimum negative value and maximum positive value


  1. Traverse the array, if the element is positive, then make localmax = localmax * arr[i], localmin = min(localmin*arr[i], 1).
  2. If the element is negative, then store localmax value in t variable and update the localmax value to maximum of (localmin* arr[i], 1), and update the localmin to t * arr[i].
  3. If the element is zero, then make localmax and localmin equal to 1.
  4. update the maxproduct(which is the maximum product till now) if it is less than present subarray product(localmax).
  5. return maxproduct

C++ Program

#include <bits/stdc++.h>
using namespace std;

int max(int num1, int num2)
	if (num1>num2)
		return num1;
		return num2;
int min(int num1, int num2)
		return num1;
		return num2;
int maxProduct(int arr[], int n)
	int localmin=1, localmax=1;//localmax is maximum +ve integer
	int maxproduct =0;			//localmin is least -ve integer
	for (int i = 0; i < n; ++i)
		if( arr[i]>0) //if the element is greater than 0
		{				//product previous max to the element
			localmax = localmax * arr[i];
			localmin = min(localmin*arr[i],1);
		else if(arr[i]==0)
			localmax = 1;
			localmin = 1;
		else  //if the element is negative
			int t = localmax;
			localmax = max(localmin * arr[i], 1);
			localmin = t * arr[i];
		if(localmax > maxproduct)
			maxproduct = localmax;
	cout<<"Maximum product is "<<maxproduct;
int main()
	int arr[]= {3, -6, -1, 0, 4};  //creating an array
    int n = sizeof(arr)/sizeof(arr[0]); //size of the array
    maxProduct(arr, n);
    return 0;
Try It

C++ Online Test - Check Your Rank across the World

Next > < Prev
Scroll to Top