C Exercises: Find maximum product subarray in a given array

Last update on March 18 2025 13:23:30 (UTC/GMT +8 hours)

61. Maximum Product Subarray

Write a program in C to find the maximum product subarray in a given array.

Expected Output :
The given array is : -4 9 -7 0 -15 6 2 -3
The maximum product of a sub-array in the given array is: 540

To find the maximum product subarray in a given array, the program needs to track both the maximum and minimum products up to the current element, as the product of two negative numbers can be positive. By iterating through the array and updating these values, the program can determine the subarray with the highest product, ensuring it captures the largest possible product even in the presence of negative numbers and zeros.

Sample Solution:

C Code:

#include <stdio.h>

// Function to find the minimum of two numbers
int min(int p, int q) {
return (p < q) ? p : q;
}

// Function to find the maximum of two numbers
int max(int p, int q) {
return (p > q) ? p : q;
}

// Function to find the maximum product of a sub-array in the given array
int maxProduct(int arr1[], int n) {
int maxend = 0, minend = 0;
int maxupto = 0;

    // Loop through the array to calculate the maximum product
for (int i = 0; i < n; i++) {
int temp = maxend;

        // Updating maximum and minimum products considering the current element
maxend = max(arr1[i], max(arr1[i] * maxend, arr1[i] * minend));
minend = min(arr1[i], min(arr1[i] * temp, arr1[i] * minend));

        // Update maximum product if needed
maxupto = max(maxupto, maxend);
    }
return maxupto; // Return the maximum product of sub-arrays
}

int main(void) {
int arr1[] = { -4, 9, -7, 0, -15, 6, 2, -3 };
int n = sizeof(arr1) / sizeof(arr1[0]);
int i;

    //------------- print original array ------------------	
printf("The given array is :  ");
for(i = 0; i < n; i++) {
printf("%d  ", arr1[i]);
    } 
printf("\n");
    //------------------------------------------------------ 	

    // Find and display the maximum product of a sub-array in the given array
printf("The maximum product of a sub-array in the given array is:  %d", maxProduct(arr1, n));
return 0;
}

Sample Output:

The given array is :  -4  9  -7  0  -15  6  2  -3  
The maximum product of a sub-array in the given array is:  540

Flowchart:/p>

For more Practice: Solve these Related Problems:

Write a C program to find the maximum product subarray using a modified Kadane’s algorithm for products.
Write a C program to determine the maximum product subarray using dynamic programming with careful handling of negative numbers and zeros.
Write a C program to recursively compute the maximum product subarray by exploring all possible subarrays.
Write a C program to identify the subarray with maximum product and print its starting and ending indices.

C Programming Code Editor:

Previous: Write a program in C to find the row with maximum number of 1s.
Next: Write a program in C to find the largest subarray with equal number of 0s and 1s.