Got two questions:

1. [Medium] Variation of longest subarray with positive product. The variation mentioned here (Q1).

2. [Hard] Variation of Sliding Window Maximum. The variation mentioned here.

It was suprisingly easier for me to solve the 2nd question since I had solved it recently. The solution for the 1st question is very naieve when I figured it out (message to self: don't start with the complex solution ideas first).

Q1 solution had time: O(n), space: O(1)
Q2 solution had time: O(n), space: O(n)

Thanks for this awesome community, it helped me alot.