Maximum Product Subarray - Best Intuitive Approach Discussed

[@Iron_Man019]

He is a real competitive programmer in all KZbinrs who teaches DSA in India

[@lakshsinghania]

guys who do cp have better problem solving skills, even doing dsa gives but cp just opens the brain to think in diff solutions

[@harshgupta5287]

Just a small change in the code for those who are wondering why 191th test case is not passing on leetcode, just change the data type of ans, pre and suff to double so as to prevent overflow in the intermediate steps. It has much bigger range than long and long long. Btw great explaination striver!!

[@brp3522]

Saved me hours of wondering. Thanks mate appreciate it

[@codersoham]

Thanks a lot bro. I was searching for this for hours until I saw your comment.

[@deepk-007]

Bro is the saviour.

[@secondthread-uc9bd]

works but cheating lol

[@brp3522]

@@secondthread-uc9bd How's this cheating dude??

[@SHASHANKRUSTAGII]

I had never seen this approach and the way you explain is like you own it.!!! Superb work striver bro

[@takeUforward]

;)

[@chiragbansod8252]

Completed this playlist also, MAN this is the best teacher of DSA. UNDERSTOOD!!!!!!!

[@sasanklakimsetti8967]

Great explanantion. Without using dynamic programming and not encountering any overlapping subproblem, he solved it and of course, explained like a boss. And he is. What a man!🙌🙌

[@pramodharshav6091]

You're God sent for us to learn in last moment ❤

[@AbjSir]

Arrays completed Tomorrow I will revise full arrays before starting binary search

[@gpraneeth7693]

How

[@SusinSunilkumar]

bro no need any more examples you were the best in explaining this question with the most examples the cases... Really understood the concept very well. Thank you for the video...

[@MischievousSoul]

I was literally searching for the intuitive approach and finally found it.. really appreciate it.. and a great explanation..

[@shreyasingh9847]

I am so happy I found your channel because every time when I searched for a solution I would directly get optimized code and I be like how they thought of this, from where did that come in their mind but you build solution making it better and better and it makes things so much better like I can recognize patterns. Thank you so much for your guidance.

[@aryanyadav3926]

Brilliant! this is actually much more intuitive as I was also thinking of applying prefix and suffix in it, just couldn't react to the final answer. Thanks.

[@messi_codes]

Best Solution , will never forget this solution .

[@vikasbagri1225]

I do not know who has observed the optimal approach but whoever the guy was, it was brilliant Thanks for your explanation Striver Understood it very well And waiting for your Binary Search series...

[@belugaop7784]

i generally dont comment on videos , but yaar striver truly is a genius

[@calvinseptyanto3110]

Had to give this a like, can't lie the best explanation for this problem.

[@moviesbuddy4228]

class Solution { public: int maxProduct(vector& nums) { double prefix = 1, suffix = 1 , ans = INT_MIN; int n = nums.size(); for(int i=0;i

[@shubhamagarwal1434]

#Free Education For All.. # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.....

[@CrytpoDeFi308]

Was struggling to understand the explanation of this problem, but after tour video I am amazed how easy it is :D

[@najimali32]

This approach is awesome! I've seen others teaching the same old Kadane approach, but this observation-based method is a real gem. Keep up the great work and keep sharing your insights!

[@AJK-a2j00k4]

The way he did it in one go without taking separate arrays before and after 0 like I did.. hatsoff you are truly amazing!

[@KarthikNandam-xs4qn]

THE GOAT of the DSA prep 🔥 hands down 🙌

[@CinematicClips-uz3mk]

Completed this playlist.... Gain confidence and knowledge.... Thank you Bhaiya ❤❤

[@Manishgupta200]

The logical thinking It's very easy to understand.. with TC -> O(N) and SC -> O(1)

[@Anything-cx4bs]

you are really the best teacher available on youtube

[@madhulikaghosh3876]

Happy to see your video. So many videos I watched for this question. Finally i can get the intutive for the question.

[@councilaxe]

The ans=max() part should come before we set the prefix and suffix as 1 Otherwise say in cases like [-ve ,0,-ve] the answer will be 1 instead of 0

[@Shanky_17]

Nice obs..

[@adityagoswami6881]

the solution was giving error for leetcode test case, so i put the finding max part before if condition , the solution got accepted

[@Ali-kf6jk]

It should work if at the start you intitialize the max at min_int or min infinity in python. This way 0 will get picked. No need to change the max() part.

[@shivanshuranjan-iitbhu889]

Another thing you can do is to store the maximum element of array in a maxele variable and return max(maxele,ans)

[@anshusoni6261]

But the solution is giving runtime error on Leetcode

[@saunaknandi1814]

Hey Striver can you add the famous Egg Dropping Problem in your DP series? It will be of great help to many students.

[@KishoreKumar-xr3fu]

Best explanation ever i have seen for this. Thank you bro 🙏

[@tungvuthanh5537]

I have watched the solution of neetcode and i must admit that you solution is very intuitive 😂

[@Brutal-gz3jz]

In leetcode take double for suffix,prefix and return value .so the last test case not gonna be int overflow

[@sumeetsinghaaryan]

double maxPro = Integer.MIN_VALUE; double pre = 1, suff = 1; int len = nums.length; for(int i=0; i

[@shishirkarki9001]

@@sumeetsinghaaryan why is it working for double but shows overflow error when using long?

[@VISHALTHAKUR-gg3dg]

@@shishirkarki9001 i also didnt get it ?

[@shishirkarki9001]

@@VISHALTHAKUR-gg3dg i came to know that double has larger range than long

[@sumanpradhan4105]

thanks broooo

[@torishi82]

Best explanations and best qualities. You are a striver indeed.

[@shivanitayde9177]

bro, you are awesome, no one teaching the DSA like you teach us ..keep going, bro

[@Rohit-fz4vd]

im so happy that i did this prblm both brute and optimal by myself....only difference in my code was i did traversal two times to calc prefix and suffix😅. BTW THANKS STRIVER YOU ARE GREAT🙇

[@iamprateek3220]

if you're getting error due to testcases with starting or ending zeroes, then this solution should work: #include #include using namespace std; int subarrayWithMaxProduct(vector &arr){ int n=arr.size(); int pre=1, suff=1,maxprod=INT_MIN,prezero=0,suffzero=0; for(int i=0;i

[@christinajoice3838]

A big shout out to you, well explained, I had the observation to some extent (to the even negative handlings), but i couldnt go till coding my observation completely, this is really well explained. Thanks Striver :)

[@cinime]

Understood! Super awesome explanation as always, thank you very very very much for your effort!!

[@santanu29]

You learn something new everyday ❤. This is the reason I love your videos. Got to learn something new.

[@shambhaviaggarwal9977]

This was such a beautiful and elegant approach

[@AbhishekKumar-dl6ko]

Completed Arrays on 09/05/24 ..Superb Content and Explanation .....

[@stith_pragya]

UNDERSTOOD.............Thanks a ton............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@stith_pragya]

Thank You So Much for this wonderful video.......................🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@halcyonramirez6469]

I actually understand this and it makes so much sense. Thanks!

[@trailblazer555]

The way he explained made me to think how to really approach a problem with logical thinking...Great Striver!!!

[@GOJOANDSUKUNAFAN]

How can you help me please

[@dhanushsanapala3287]

the best approach i have ever seen

[@ChiragNanda-k6j]

Thanks for the great playlists for DSA

[@thedon713]

Hey Brother..At first thank you for your great work..Now I am learning Recursion from your recursion playlist..Love you from Bangladesh

[@sudiptamaity-e]

I solved this problem using a extended version of kadane's algorithm: class Solution { public int maxProduct(int[] nums) { int currmin=1,currmax=1,max=nums[0]; for(int n:nums) { int temp=currmax*n; currmax=Math.max(currmax*n,Math.max(currmin*n,n)); currmin=Math.min(temp,Math.min(currmin*n,n)); max=Math.max(max,currmax); } return max; } }

[@akshdhingra2700]

This Guy is Next Level

[@ashutoshupadhyay5683]

u just fired it man.....what an awesome explanation....Thanks bro for the help.

[@killeraloo3247]

Bhai mast video thi. Teeno algo's samajh mein aa gyin.

[@anshlyk]

Thanks for the great explanation, it feels like you are explaining me one to one the way you place your face on the screen!!

[@dank7044]

I think the super clean implementation was very nice.

[@playwithlinux]

Nice Explanation and intuition for this problem.. Thanks a million Striver. ♥♥♥

[@harshraj3522]

finally array completed..thanks striver bhaiya

[@CyberZeo]

Thank you so much for this beautiful explanation

[@aryasharma69]

Java code for 191th test case:- class Solution { public int maxProduct(int[] nums) { int n=nums.length; if(n==0)return 0; double ans= Integer.MIN_VALUE; double pref=1, suf=1; for(int i=0; i

[@zaid6493]

awesome teaching and please teach every problem how to identify the pattern which algo we need to used.. and try to explain all the approaches. by the way your videos are great you will deserve 1m soon.

[@selvaarumugam370]

U jus explained the problem in a way it was made simple

[@hi-tk4hu]

Yes when I first saw the solution with kadanes it made me depressed fr, but this approach I will never forget

[@Irfankhan-nc2gt]

Thankyou Bro❤ I have Huge of respect and Thankfulness for you 🎉you are doing such a great thing ❤❤

[@hrithikmulik8480]

Hey Striver can you add the famous Egg Dropping Problem in your DP series? It will be of great help to many students.

[@gauravharbola1334]

Hi striver, first of all this is the best video that i have seen till now for this problem. Secondly, don't you think this is kadanes algorithm only. We did the same thing like adding all the elements till the end and when we got a negative element will turned that to 0. But this time we are doing from both the sides....

[@prashanthreddy3840]

This approach is excellent.

[@sukhpreetsingh5200]

amazing explanation just amaze with the approach

[@PDSREACTION]

bro is this array playlist good?

[@sukhpreetsingh5200]

@@PDSREACTION Not only array but all the playlists brothers without any doubt

[@cruzer_blade.]

best explanation sir 😁😁

[@Lord_Biyoma]

superb and easy to understand explanation !

[@ishangujarathi10]

the optimal solution, too good and intuitive as you saidd!!!

[@hashcodez757]

Understood again Bhaiya!!

[@bajrangijha]

mind blowing approach

[@jaditi930]

amazing explanation. thanks a lot.

[@yogeshedekar6078]

This solution works well except one edge case where we have a 0 in the array and even number of negative elements. In that case there is a possibility that 0 is our final answer if all other multiplications are negative. A simple tweak can help us solve this just maintain a zeroflag and before returning the answer just check if the answer is negative and the zeroFlag is set in that case we will simply return zero as our answer since we have a zero element in the array and the maximum subarray product excluding zero is negative.

[@aarzookhunger9487]

But that's already covered. Let's take an example as per your expl. : -4 0 -5 , here 0 exists and even negative elements In the first iteration pref=-4 suff = -5 , max=-5 second : pref=0 , suff=0 , max = 0 third : pref=-5 , suff=-4 , max=0 So we need not take any such flag or maybe you can specify any test case where your approach will work.!

[@AnujSingh-us5pw]

​@aarzookhunger9487 bro first of all -4 is greater than -5, and second consider this case [-3,0,1,-2] here we should get 1 we the code will return 0, so the only we need to do is reset the predix and suffix prod to 1 after the max computation

[@sujalchandrakar3874]

This will pass all testcases in leetcode class Solution { public: int maxProduct(vector& nums) { long long pre=1,suf=1; long long maxi=INT_MIN; for(int i=0;i

[@kergeysarjakin5592]

thanks bro

[@mohammedharoon1167]

Just another level 🔥

[@AbhishekGhume]

One test case fails in leetcode using this solution. Below is the corrected code. Take prefix and suffix as double. class Solution { public int maxProduct(int[] nums) { int max = Integer.MIN_VALUE;; double prefix = 1; double suffix = 1; for(int i=0; i

[@bombblaster6945]

can please tell me the for taking it as double

[@raghav5354]

I am just here to thank you for acknowledging that kadane's algorithm is not intuitive. I thought I was dumb for not being able to come up with kadane's intuition(while every other person I see is like - "oh yes kadane's algorithm, that’s so obvious").

[@AdityaSingh-ql9ke]

After your hinting, I got the approach...but then I realized ,if we have 0s, then what to do

[@lokeshroy3944]

optimal approach is very intuitive .......but the one pass implementation is not......but u explained it very well

[@vineet1728]

Add checks at line 11 and 12, such that prefix and suffix product does not overflow integer limits. if(prefix

[@Lakshya-f4l]

Giving wrong answer at one test case😬

[@sahilrao4592]

@@Lakshya-f4l just assign double instead of int .

[@graviton001]

Test case is 3,0,-2,1 its giving wrong answer

[@himanshusingh6229]

Huge respect brother♥

[@Ramsiya658]

Understood striver much love to you

[@HarishSubash]

double prefix = 1; double suffix = 1; pls consider this logic of double to prevent overflow of int data type in the test case of 190

[@tanaysingh5348]

Really needed this

[@ujjvalsharma5055]

Great Approach!

[@dsa_tutorial]

really great explaination !!!

[@maheshchaugule8940]

Thank you, very helpful

[@Josuke217]

Nice solution

[@debanjan10]

Areh Dada ,,, watta approach

[@LokeshSharma-hm5jz]

very nice video, Just like a story. Thanks. great

[@pubgbattleground9208]

ek number solution!!

[@rithikgandhi3685]

Great solution

[@hashcodez757]

Understood Bhaiya!!

[@saketjaiswalSJ]

6:58 optimal

[@epistemophilicmetalhead9454]

It feels massively illegal to watch these videos for free

[@rosepainting8775]

I have solved this problem before, but still I would like to know your approach on this

[@DeepuPk-g9q]

Striver, I think you forget one corner case when input array is [-2,0,-1] this the maximum product of subarray is 0 when you run your code the answer if -1 not zero. ie, The product of left side array of 0 is negative and product of right side of arrya of 0 id negative so maximum product is zero. I think you miss this corner case

[@anupamsinghmnnitallahabad6226]

what an approach sir

[@dayashankarlakhotia4943]

Good explanation and much intuitive

[@BabaHanuman2612]

Which topic will u gonna teach next, Binary search or strings?

[@ankit_yadav11]

it failed on -2,0,-1 answer is 0 but this gives -1

[@niharikakumar1533]

Thank you bhaiya 🙂

[@RakeshVishwakarmaVishwakar-c8i]

Agr apke jaise sir paid me bhi comtemt de toh public pakka legi 🫡🫡