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.

Given an array arr[] that contains both positive and negative integers (and possibly zeros), find the maximum product of any subarray within the array. Note: The result will always fit within the ...