int ans = nums[0], minn = nums[0], maxx = nums[0], temp = 0; The Brute force method says we can simply apply 2 loops for calculaing all sub-arrays and finding the max product. But, the Optizimed way ...

# Find the contiguous subarray within an array (containing at least one number) which has the largest product. # For example, given the array [2,3,-2,4], # the contiguous subarray [2,3] has the ...