Maximum Product Sub-array (LeetCode 152) | Full Solution with animations and proof | Simplified

Chapters:
00:00 - Intro
00:45 - Problem Statement and Description
02:43 - Breakdown the problem into parts
07:36 - Proving the idea
11:32 - Dry-run of Code
13:35 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview

[nikoo]

As of this writing LeetCode added a new test case which cause the above code to fail. The logic is still correct though.

The test case fails because of overflow error. With just a small fix, the code still works. Have a look at the updated code on my Github link :)

[sayedmahmudulalam]

This is the simplest and most intutive solution.

[yashbhinwal]

you did a great job explaining this concept, really helpful!!

[hoddybhaba]

Fantastic explaination👏👏👏You deserve more likes, more views and definitely more subscribers!!!

[andreabad]

I was really struggling to understand some other solutions for this problem that used dynamic programming, but you really made it simple to understand! Thanks!

[vineetkumar]

the way you explain things are just Awesome.

[subhadippahari]

What an explanation. Really mind-blowing. Saw other videos on the same topic, but this is a really whole different level of logic.

[faizuddin]

Very clean, clear and simple explanation.

[ghanashrim]

Your explanations are so on point yaar... I've been binge-watching all your videos...!
Please make more.

[stanislavmozolevskiy]

I do really like your solution, it is so much easier to understand. Thank you

[akhintheruvath]

Crisp and clear explanation. Thank you bro.

[MinhLe-ksen]

This is genius. You deserve more likes and more subscribers. I love your systematic way of explaining the reasoning.

[yashyadav]

bhai tum kya bande ho yaar… when other top teachers and youtubers fail to explain the hardest problems, you explain those problems so easily somehow….. Man you deserve so much appreciation… Great work bhai..so much inspired by you… Really top-notch explanations.

[samiramousaie]

your explanation is awesome. I totally understand it.

[jironymojirolamus]

Great explanation, thanks! I actually solved it in a similar way, but was unsure if it's a way to go since everyone is talking DP nowadays.

[avinashabhi]

Your explanation is superb. Subscribed.

[rajalakshmirajasekar]

Bro ur explanation is awesome!! I am able to think the flow of program and build the intuition easily.. one request bro Plz upload recursion vdos.. Thank you!!

[shreyanshgoel]

Your solution impies that ans subarray lie either in suffix or in prefix in non zero elements are present

[amitmandal]

Excellent explanation. I mean, you made question easy.. valaaaah😊

[zljuttg]

this is the best simple solution even the editorial solution is nothing infront of this