Maximum Product Subaray Leetcode | Leetcode 152 | Leetcode September Challenge

Maximum Product Subaray Leetcode | Leetcode 152 | Leetcode September Challenge

Correction in video:
At 2:48 (The part where i explain 2nd case ) : consider the array as -13 2 -6 -3 and not -13 -6 2 -3.
consider previous minimum as -13 and not -12.

Hi
Welcome To our channel Code Bashers.

About Video:
This video is about september day 11 leetcode challenge (Maximum Product Subarray).

Queries solved in this video:
1)What is Maximum Product Subarray.
2)Explanation of Maximum Product Subarray through examples.
3)Approach of solving Maximum Product Subarray.
4)Code for Maximum Product Subarray in c++.

See video for explanation with example and dry run.

Complexity Analysis:
Time Complexity : O(N)
Space Complexity : O(1)

#codinginterview #placementquestion #leetcode #arrays #code

Please Like , Share , Subscribe and forward it to your friends.

Thank You

Links to previous videos:
Bulls And Cows Leetcode | Leetcode 299 | Leetcode September Challenge

Sum of Root To Leaf Binary Numbers | Leetcode 1022 | Leetcode September challenge

Word Pattern Leetcode | Leetcode 290 | Leetcode September Challenge

Image Overlap Leetcode | Leetcode 835 | Leetcode September Challenge :

Partition Labels Leetcode | Leetcode 763 | Leetcode September Challenge :

Repeated Substring Pattern Leetcode | Leetcode 459 | Leetcode September Challenge | Hindi :

Contains Duplicate III | Leetcode 220 | Leetcode September Challenge | Hindi:

Largest Time for Given Digits || Leetcode 949 || Leetcode September Challenge || Hindi:

About Channel:
Our channel make videos related to programming. I hope my content helps you land the job of your dreams and become a better engineer!