MediumCoding

Find the maximum subarray product

Asked at

1Give yourself 5 minutes

2Answer out loud, not in your head

3Then compare with the answer below

Reference answer

This problem can be solved efficiently by iterating through the array twice. First, iterate from left to right, maintaining a running product. If a zero is encountered, reset the running product to 1. Keep track of the maximum product seen so far. Then, repeat the process by iterating from right to left, again resetting the running product to 1 upon encountering a zero. This two-pass approach handles cases with negative numbers and zeros effectively, ensuring the global maximum subarray product is found.

Free to read · better with Enzo

Practice this out loud with Enzo

Enzo runs it as a mock interview, pushes back with follow-ups, and grades you on the rubric.

Continue with Enzo Sign up free

Next question

Calculate the trapped rainwater between bars in a given array.
Find a triplet in an array with a given sum.
Print all combinations of numbers from 1 to n that sum to n.
Find the number of rotations in a circularly sorted array.
Coin Change
Find all permutations of a given string.