Maximum Product Subarray | Leetcode September Challenge Day 11 | leetcode 152

Quick Links
1) 0:00 Understanding the problem
2) 0:18 Walkthrough of the algorithm with example/ Various test cases
3) 0:Stating the contenders for the maxProd at any point in array
5) 3:52 Coding it up
6) 6:07 Analysing the time complexity

Time complexity O(n) n is the length of the array
Space complexity O(1), constant space

Solution