Leetcode 1567. Maximum Length of Subarray With Positive Product

[@elliotdunlo3735]

Thank you for the explanation. I couldn't do it at first but after watching the idea behind your solution, I could write the code myself.

[@arpitomar7875]

nice explanation.

[@pranavdharkar]

i tried the same thing at the code while(nums[e] != 0 && e < n) leetcode gives heap buffer overflow(index out of bound ) but how it is working on this ide.

[@kashyapbavadiya]

Good Explaination and Approach... Thanx Fraz

[@iamnoob7593]

Thanks Fraz , Understood

[@PushpendraSingh-bx2iz]

I think the condition at line number 27 will always be true because control came to the else loop since it had odd number of negative numbers and in that case sn!=-1 will be surely true
Hence we can write line number 27-28 as :- ans = max(ans, max(e-sn-1, en-s);

[@ratnasanjay]

Thankyou bhaiya for this session

[@shantanukumar4081]

Great Explanation !!!

[@mohammadfraz]

Thanks ☺️

[@code_wid_moni]

crystal clear explanation!! Thanks brother.

[@lkoh]

Thank you so much for the explanation.

[@snehel1586]

very helpful and clean code, i implemented the same method as yours which was given in the hint section of the leetcode problem but wrote such a messy code and it didn't worked.

[@akashjaiswal6478]

Really helpful video, thanks brother

[@AmarjeetKumar-to9ub]

🔥++

[@parthamishra09]

Thanks. This is a good one.

[@kbcoder3734]

Real nice explaination

[@ishanpandey2949]

Very beautiful explanation. An easy problem though.

[@ashiquddinpranto4275]

Thanks a lot...

[@abhishekbabbar9234]

Clearly explained 🔥

[@computerscience2589]

i got a TLE on leetcode

[@souravkumar-hl2ot]

☹️😭