- oh no! Time-limit exceeded on a 4 cases... - need to cut-down on cases where it wouldn't be possible then somehow - if we save only the max and min of the prev (k-1), rather than all products - the ...

* Q. Given an array arr[] that contains positive and negative integers (may contain 0 as well). Find the maximum product * that we can get in a subarray of arr[]. * Note: It is guaranteed that the ...