152. Maximum Product Subarray | Amazon question

Given an integer array nums, find a contiguous non-empty subarray within the array 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. A subarray is a contiguous subsequence of the array. PROBLEM LINK : https://leetcode.com/problems/maximum-product-subarray/