Problem #152 is a tougher extension of the Maximum Subarray product (which deals with maximum sum.) Here we break down the one-pass O(N) time and O(1) solution -- let me know if it helps! :)
https://leetcode.com/problems/maximum...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Let's connect on LinkedIn!
/ aleksmitrovic
Follow me on Medium!
/ mitrovic.aleksandar
Questions or suggestions for new videos? Email me!
babybear4812@gmail.com
On this page of the site you can watch the video online MAXIMUM PRODUCT SUBARRAY (Leetcode) - Code & Whiteboard with a duration of hours minute second in good quality, which was uploaded by the user babybear4812 19 October 2020, share the link with friends and acquaintances, this video has already been watched 825 times on youtube and it was liked by 31 viewers. Enjoy your viewing!