Maximum Product Subarray | LeetCode 152 | C++, Java, Python

Data Structures & Algorithms course: www.udemy.com/course/data-str...
LeetCode Solutions: • LeetCode Solutions | L...
Github Link: github.com/KnowledgeCenterYou...
*** Best Books For Data Structures & Algorithms for Interviews:*********
1. Cracking the Coding Interview: amzn.to/2WeO3eO
2. Cracking the Coding Interview Paperback: amzn.to/3aSSe3Q
3. Coding Interview Questions - Narasimha Karumanchi: amzn.to/3cYqjkV
4. Data Structures and Algorithms Made Easy - N. Karumanchi: amzn.to/2U8FrDt
5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: amzn.to/2U0qZgY
6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: amzn.to/2Wdp8rZ
*****************************************************************************
September LeetCoding Challenge | Problem 11 | Maximum Product Subarray | 11 September,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Maximum Product Subarray,
Maximum Product Subarray c++,
Maximum Product Subarray Java,
Maximum Product Subarray python,
Maximum Product Subarray solution,
152. Maximum Product Subarray,
#CodingInterview #LeetCode #Google #Amazon #MaximumProductSum

[@koteshmeesala1630]

sir, how do you remember all these algorithms? What is the best way to remember and practice these algorithms? How to get better at these everyday ? I do it everyday, but somehow I feel that I am not following the right approach to solve them

[@arpitsatnalika]

Ever youtuber read geeksforgeeks article before making the video.

[@suvamroy6205]

Practise

[@kushal3593]

Crystal clear explanation, 19min well spent. Appreciate the effort

[@KnowledgeCenter]

Thanks. Glad to hear.

[@Kidkromechan]

Thank you for the explanation. I wonder who comes up with these ingenious solutions of remembering the minimum numbers to make sure not to lose track of the overall product with negatives along with the max counter lol.

[@xinlee3785]

Excellent and crisp explanation. Keep up the good work.

[@KnowledgeCenter]

Thanks a lot!

[@rahulchudasama9363]

In the same problem, how can we find that SubArray?

[@danielmcgee2447]

how do you get c++ to allow 3 parameters for max()?

[@MayankSingh_is_me]

behad krantikari explanation!!! :D

[@KnowledgeCenter]

Dhanyabaad.

[@ujjvalsharma5055]

I must say great video and great explination. It honestly deserves more views I encourage you too make more videos. Your channel will definity grow

[@KnowledgeCenter]

Thanks for the motivating words.

[@pillivineeth5103]

Loved your logic...Thanks

[@KnowledgeCenter]

Thanks and welcome

[@anshulcse5733]

Great explanation bro,, keep making such good videos

[@feraligatrs]

Watched 3 videos before I got to yours and finally understood it! Thank you!

[@KnowledgeCenter]

Great to hear!

[@jimwoodward7293]

Here is my solution -- very similar to yours. Thanks! def kadanesMaxProduct(array): maxOverall, minEndingHere, maxEndingHere = 0, 0, 0 for i in array: tmp = maxEndingHere maxEndingHere = max(i, maxEndingHere * i, minEndingHere * i) minEndingHere = min(i, tmp * i, minEndingHere * i) maxOverall = max(maxOverall, maxEndingHere) return maxOverall

[@kathaosmart478]

very clear. Thank you

[@KnowledgeCenter]

Glad it was helpful!

[@ankushroy919]

if our max so far is -10 and min so far is -2 and A[i] is also -ve then this approach will work?

[@KnowledgeCenter]

maxsofar should not be less than minsofar, if I said that it is a mistake.

[@arjunagarwal2248]

very detailed explanation!!

[@KnowledgeCenter]

Thanks

[@paragroy5359]

Nice explanation sir...really good video

[@KnowledgeCenter]

Thanks and welcome

[@ChristianESL]

Can this be considered dynamic programming?

[@KnowledgeCenter]

Yes, in particular this approach would be bottom-up dp, with space optimization.

[@venkatarakesh1698]

I am python user, can cracking the coding interview book useful to me. Because it has written in java

[@xinlee3785]

You can understand the logic and write in Python. I also do it. It gives you even more practice.

[@akshaysolanki5164]

Thanks a lot!!

[@KnowledgeCenter]

Pleasure.

[@bitrish34]

Efficient & clear

[@KnowledgeCenter]

Thanks.

[@dhanashreegodase4445]

Thanks again

[@KnowledgeCenter]

Welcome

[@shreelakshmi6890]

nice explanation!

[@KnowledgeCenter]

Thanks! 😃

[@tekbssync5727]

your voice is like " Amitabh bacchan " 😂😂

[@KnowledgeCenter]

Haha 😂

[@rajatsharma6137]

dry run was not explained properly.....

[@dhananjaygola4786]

I wanna know your IDE Did you use this often ? Recommend me the best one plz

[@HACKINGMADEFUN]

VSCode

[@elhamabbasi8214]

It was a really good explanation, Thanks

[@KnowledgeCenter]

Thanks.

[@ayushsingh3553]

thanks sir

[@KnowledgeCenter]

Welcome.

[@AyushKumar-lr9po]

no use of temp

[@Aysh_Sach_16-2]

is python not allowed in coding interviews?

[@KnowledgeCenter]

Why not.

[@shalomalexander7811]

I understood how to do it just by watching till 15th min. Nice.

[@KnowledgeCenter]

Glad to hear.

[@shishirpandey7762]

i don't see zero case being handled here in the code

[@KnowledgeCenter]

Sometimes I skip base case handling if it's explicitly mentioned in Question. In Question it's mentioned nums.length >= 1.

[@yashverma3811]

@@KnowledgeCenter i think Shishir was talking about a case when we find 0 in array......if we find 0 then why should we include it because may be our max product is not yet found for example {1,2,0,3,2,1,4} in this case the code you shown will give wrong output. Handle this case please.

[@KnowledgeCenter]

@@yashverma3811 The code I shown should give 24 as output for your example: {1,2,0,3,2,1,4}. i.e., 3*2*1*4 = 24. please verify, and let me know if it fails.

[@yashverma3811]

@@KnowledgeCenter yes it is correct sorry i thought it will give wrong output, i understood it now.

[@nikostrongioglou9941]

At 08:46 you're saying that "if min_ending was positive then multiply it with the max ending - so whatever was the max_ending and if that is positive multiply it. That will become further positive. So that will be the max". Based on this I am expecting to see something like min_ending=max(min_ending*max_ending, A[i]) in your solution but you end up writing something completely different. Is there any chance you can provide the exhaustive if condition before simplifying it into this 3 liner function?

[@master_persi]

max_ending_here=mm, min_ending_here=mn, hope this helps int res=nums[0],mm=nums[0],mn=nums[0],temp=1; for(int i=1;i

[@madhavnagpal1860]

10 90 91 -91 91 -91 -90 90 90 -90 -90 this test case is failing

[@madhavnagpal1860]

Its Correct output is: 404928287208900000 And Your Code's output is: 449942298618103232

[@Karuska22ps]

how are you even supposed to know how to come up with this bullshit on your own? do people really just memorize the solution?

[@snigdhagupta3008]

Your explanation is too crooked. You should explain in a structured manner. What is max_ending? and what is min_ending? How did you calculate it??