Answer: GitHub SWE Interview Question 2022 December | Arrays and Dynamic Programming | o

Solution: Track Both Maximum and Minimum Running Products Approach Unlike the maximum subarray sum problem (Kadane's), products are tricky because a large negative product can become the maximum when multiplied by another negative number. So at every step, track both maxProd (the maximum product ending at current index) and minProd (the minimum — most negative — product ending at current index). At each element, the new max could come from: current element alone, current element times old maxProd (positive times ...