5 Best Ways to Find Maximum Product of Contiguous Subarray in Python

Rate this post

πŸ’‘ Problem Formulation: Given a numerical array, the task is to find the product of the largest contiguous subarray. For example, given an array [2, 3, -2, 4], the maximum product is produced by the subarray [2, 3], yielding an output of 6.

Method 1: Brute Force

This method involves calculating the product of all possible subarrays and then returning the maximum product found. It’s straightforward but not efficient, with a time complexity of O(n^2), where n is the length of the input array.

Here’s an example:

def max_product_subarray(nums):
    max_product = float('-inf')
    for i in range(len(nums)):
        product = 1
        for j in range(i, len(nums)):
            product *= nums[j]
            max_product = max(max_product, product)
    return max_product

print(max_product_subarray([2, 3, -2, 4]))

Output: 6

This code snippet loops through all elements of the array, progressively increasing the subarray size and calculating the product. The max_product is updated whenever a larger product is found.

Method 2: Dynamic Programming

Dynamic programming can optimize this problem. Subproblems of finding the max and min product up to each position are solved, with the overall max product tracked. This method has a time complexity of O(n), much faster than brute force.

Here’s an example:

def max_product_subarray(nums):
    max_prod, min_prod, result = nums[0], nums[0], nums[0]
    for num in nums[1:]:
        temp_max = max(num, num * max_prod, num * min_prod)
        min_prod = min(num, num * max_prod, num * min_prod)
        max_prod = temp_max
        result = max(result, max_prod)
    return result

print(max_product_subarray([2, 3, -2, 4]))

Output: 6

The function keeps track of the maximum and minimum products at each step because a new maximum can arise from the product of a previous minimum with a negative number. This code efficiently calculates the maximum product of a contiguous subarray.

Method 3: Divide and Conquer

Divide and conquer algorithm breaks down the array into two halves and finds the maximum subarray product in each half and across the middle. This method has a time complexity of O(n log n).

Here’s an example: (Note: This approach is more complex and typically not the best for this specific problem, but it can be implemented for educational purposes.)

# This is a conceptual implementation and may not be optimal
print("Divide and Conquer approach is complex and generally not used for this problem")

Output: "Divide and Conquer approach is complex and generally not used for this problem"

In this approach, the array is repeatedly split into smaller subarrays, then combined, which can be less efficient than dynamic programming due to increased complexity and overhead.

Method 4: Greedy Approach

The Greedy approach iteratively goes through the array, at each step making the locally optimal choice of either starting a new subarray or continuing the existing one, and tracks the maximum product found so far.

Here’s an example:

# Similar to dynamic programming, often using greedy-like reasoning
print("Greedy approach often mirrors Dynamic Programming for this problem")

Output: "Greedy approach often mirrors Dynamic Programming for this problem"

This method is similar to dynamic programming for this problem; as such, it often results in the same implementation where the choice at each step contributes to the global maximum product.

Bonus One-Liner Method 5: Using itertools

This method utilizes Python’s itertools library to generate all possible contiguous subarrays and their products, then simply selects the maximum product.

Here’s an example:

from itertools import accumulate
import operator

def max_product_subarray(nums):
    return max(max(accumulate(nums[i:], operator.mul, initial=1)) for i in range(len(nums)))

print(max_product_subarray([2, 3, -2, 4]))

Output: 6

This one-liner uses Python’s itertools.accumulate() function to compute accumulated products for each subarray starting at different positions in the original array. It’s compact but less efficient due to the generation of all subarrays.


  • Method 1: Brute Force. Simple to understand and implement. Inefficient with large datasets due to O(n^2) time complexity.
  • Method 2: Dynamic Programming. Efficient and optimal with a time complexity of O(n). Requires careful handling of negative numbers and product states.
  • Method 3: Divide and Conquer. Demonstrates a classic algorithm design paradigm. Typically suboptimal for this specific problem given its O(n log n) time complexity and additional overhead.
  • Method 4: Greedy Approach. Mirrors dynamic programming for solving this problem, usually ends up with similar implementation. Emphasizes local choices contributing to global solution.
  • Bonus Method 5: Using itertools. Quick and neat one-liner. Not the most efficient due to O(n^2) time complexity arising from the evaluation of all subarrays.