Maximum Product Subarray
Tracks max and min product dynamically to handle negative sign reversals.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def max_product_subarray(arr):
res = max_p = min_p = arr[0]
for x in arr[1:]:
if x < 0: max_p, min_p = min_p, max_p
max_p = max(x, max_p * x)
min_p = min(x, min_p * x)
res = max(res, max_p)
return resEmbed this visualization
Drop a live, looping Maximum Product Subarray canvas into a blog post or course page.
<iframe src="/embed/max-product-subarray" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of Maximum Product Subarray?
Maximum Product Subarray runs in O(n) time and O(1) auxiliary space.
Is the Maximum Product Subarray visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask Maximum Product Subarray in interviews?
Maximum Product Subarray shows up in interviews at Nvidia, Intel, Qualcomm.
How does the 3D visualization of Maximum Product Subarray work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.