Please find the source code at https://github.com/SivaprasadTamatam/Go-DSA/tree/main/Arrays/6-Maximum%20Product%20Subarray
[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)
Given an integer array nums, find a
subarray
that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bit integer.
Example 1:
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
