In this video we are solving an Amazon interview question: Maximum Length of Subarray with Positive Product (Leetcode 1567).
At first this question seems difficult because there are so many combinations of subarrays you can form but there is a nice and easy way to do it in a greedy manner where we only pass through the input array once. Stay tuned to find out ho