Maximum Product Subarray
Medium
Dynamic Programming
Print the largest product of any contiguous subarray.
Constraints
1 <= n <= 2 * 10^4 -10 <= nums[i] <= 10 The answer fits in 32 bits
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.