DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥

[@trex4997]

Bhaiya u r God sent angel. God heard the upcoming SDE's cry the whole nights, and then planted the idea of making DSA playlists in your head. Bowing to your intellect, dedication and hardwork .

[@PankajYadav-zg1re]

Finally I got the exact idea how the recursion works in MCM problem , before your vdo I have watched a lot but didn't get clear idea ......You are awesome bhaiya ❤️❤️❤️❤️

[@ayushjain386]

Can you help me i am not understand steps= a[i-1]*a[k]*a[j]+func(i,k)+func(k+1,j) Why are again call function func (i,k)+func(k+1,j) again

[@sanketmudholkar2889]

@@ayushjain386 Because we have to compute the smaller part also like if we have (ab) and (cd) so we have to solve ab and cd seperately also .

[@prakharsingh9710]

@@ayushjain386 bro,suppose (AB)(CD) hai to finally AB * CD krne ka cost aaya hoga but (A*B) apne aap me bhi ek ques h n isko multiply krne me bhi cost aaya hoga to usko nikalne ke liye func(i,k) use kiya hai. Similarly, (C*D) ko bhi krna hoga jo ki other left over part hai partition ke baad to usko func(k+1,j) likha....! Thoda pen chalao or video waps dekho aajayega

[@aayushisaha8]

👏👏👏 To everyone who made it this far !! And Double 👏👏 for those who didn't 💤 during this video . Cause it's a reallly long video ( ig mini movie 😅) . And just thinking of how much effort Striver bhaiya must have gone though to make it , edditing it , correcting it 👏👏 , Frankly speaking of me I dozed off 😪 a couple of times during the entire video 🤪 . But anyways Great Work , Striver bhaiya ✌

[@momozkichutney]

arey aaram se bolo didi, ye beech beech mei daure pad rhe h kya!

[@girishbhargava6367]

@@momozkichutney 🤣🤣🤣🤣

[@AshokKumar-ii4qr]

@@momozkichutney wo stree h k6 v kr skti h 😂😂

[@anshumann]

Lgta hai didi zyda moody hai bich bich itna mood swings 😂

[@theexplorer9012]

ye kya bawasir likh diya be

[@anmolagarwal5950]

That's the best video ever on Partition DP 👏 so much effort goes into making such content for generations, hats off man 👏👏

[@gyanunlimited740]

Its been 6 years since I came across this topic and finally understood it today

[@trijalsharma4471]

you've been unemployed for quite some time 😆

[@codingalley6229]

@@trijalsharma4471 solving a damn specific problem doesn't mean you are smart buddy.

[@ganeshkamath89]

Thanks Striver. Understood. 6 months back I had tried to learn it but I found it difficult. With your explanation I think I will remember how to do MCM and partiton DP.

[@digvijaysinghchauhan5795]

I tried it multiple times earlier but now I got better understanding, indeed it will stuck in my mind now.

[@rishavsaha5254]

Understood. Before starting this topic, I had 0 knowledge about this topic, now after completing this video, I am taking the complete concept. Thank you so much for coming up with this amazing DP series striver.

[@krrajavlog]

❤️

[@rutwikmore7462]

I also

[@stith_pragya]

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

[@madhuryareddy3994]

Thanks for existing man, you don't know how thankful I am🙏🙏you made this explanation such that I can never forget this concept in my life.

[@mohitagarwal3639]

Hey Striver again thanks to you for teaching in such a wonderful way. I paused the video at 25:30 after understanding the approach to the problem and was able to solve upto memoization by myself. Thanks man keep up the good work.

[@sameersahu4569]

What an explanation....Partition was a concept i was not much clear with ..... Thank you for making me understand this concept

[@dhikshithgoshika2700]

wah wah got the depth of deep recursion took me 2 days to completely write the total recursive code and understand .really striver bayya if you and your videos are not there many of us would leave hopes for preparing other companies , may god give you all the health and wealth bayya 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@Mr.Indianwxvhehsy9191hghgx]

thanks gyani baba@boomsi69

[@sathwikabhignan1862]

my goodness!! crystal clear explanation I am grateful for your dp series, thank you, Striver.

[@sakshigupta4793]

TBH for dp series Aditya Verma & you are the best. 😊

[@arijitdas4560]

understood that is not a question this a concept .... hats off to your efforts man you are just amazing

[@VinayKumar-ze2ww]

Another great video, thanks striver for making me understand MCM 50 minute sound huge but it just flew by

[@shashwatdhingra3580]

Best Ever Explanation for MCM. Literally!

[@rohan8758]

Understood, I am feeling very sleepy, time is 2:11 AM but this video motivate me to watch it till i understand it completely, lot of Thanks @Striver for your DP Series!!!!

[@vivekpaliwal1876]

I like your vedios...your way of teaching is good...but 1 thing you can add at start of vedios that which application uses this algorithm just to increase interest in learning the algo...

[@dhirenpatil8600]

Really nice explanation srtiver. I like the way that you teach and understood the MCM.Very tricky but now understood.

[@adarsh_k_agrawal]

Understood LIS Pattern completely. Watching all the videos from the start of DP. It is really really helpful. Every concepts are clear and will surely finish the playlist. Thank you Striver, emiti amazing content pai.

[@Noob_Coder1234]

HATS OFF TO THE GOAT STRIVER , HE HAD PUT LOT OF EFFORTS FOR US IN THIS VIDEO SO WE CAN UNDERSTAND THIS TOUGH TOPIC , REALLY AMAZING❤❤

[@sumeetkumar4984]

bhaiya bahut accha samjhaya....thanks a lot

[@JothiprakashThangaraj]

Got it when going through coluple of times thanks a lot !!!

[@suyashjain3223]

Amazing Explanation!!!

[@shivanssingh4897]

Hi Striver, can you explain problems on pattern dp like burst baloons etc. Your explaination is very good btw.

[@takeUforward]

Soon!

[@shreyasingh1258]

@@takeUforward jaldi le aao bhaiya, can't waitt!

[@ritwik121]

@striver Great explanation ... hope you will making a video on burst ballons and how to think for that problem ...

[@deepti8920]

The best video on partition DP I came across! Good job!

[@priyanshkumar17]

Excellent explanation - Partition DP Starts!!!

[@nowitspk]

Understood ------------------------------ Recursion :- TC---> exponential Memoisation:- TC---> O(N*N*N) SC--->O(N*N) + O(N)

[@chanchalroy3417]

Just understood the whole concept of partition DP at one go 🙌😌🔥

[@madhavdwivedi5146]

kya mast padhaya hai.....aapko dekhke mera khud padhane ka man hogya...❣❣❣❣❣❣

[@108_adityakumar6]

Understood.🔥🔥Your dp series is best.

[@UECAshutoshKumar]

Thank You Understood!!!

[@ritikshandilya7075]

Thankyou for amazing solution Striver

[@suryanshsingh5304]

Understood! Hats off🙏

[@itishachoudhary906]

Thank you Sir ! Understood.

[@aftabalam7103]

Very clear and solid explanation,Thanks buddy

[@cgoxo]

It takes a lot of effort to explain more than one example in detail. Thank you so much for this.

[@sanskarkumar028]

very calm and easy solution . thanku u striver

[@rupamhari115]

MCM was always been a nightmare for me, and now, I finally understood. Thank you so much bhaiyaa!! 🙏🙏🙏🙏

[@Parthj426]

awesome lecture striver , understood

[@shivisingh9975]

Understood! very well explained

[@samyakjain7422]

areeee bhaiyaaa omphooo!!! zammmn bhai understood....saying this video is god damn amazing is an understatement.

[@prettylilnerdy6802]

Nice tricks for solving all partition dp

[@cinime]

Understood! Thank you sooooo so SO much as always!!

[@fmkhandwala39]

AMAZING EXPLANAITION AS USUAL!

[@anirbannaskar5495]

I have not seen such good explaination for this problem bhaiya, thanks for making such good conceptual problem!!

[@DevashishJose]

Understood Thank you so much

[@ronakslibrary8635]

Understood , difficult concept explained easily🤯🤯

[@rohitn6333]

Thanks a lot for such a wonderful explanation sir :)

[@parthsalat]

The Great Rohit Negi is here!

[@TXS-xt6vj]

No one can be better than you striver

[@bakyt_yrysov]

Thank you soo much!! Please, keep posting such this amazing content!

[@juniorboy1903]

It's hard but u have made it very easy to understand thanks bhaiya 😃😍

[@sauravchandra10]

Clearly understood, thanks!

[@TXS-xt6vj]

Absolutely world class

[@manasranjanmahapatra3729]

Super Clear Understood.

[@rohandevaki4349]

thankyou bro, very clear and easy explaination .

[@sanaaroraa9315]

Amazing! understood

[@TXS-xt6vj]

Just like messi, no one can be better than this teaching, so underrated

[@manasagarwal9341]

Just one doubt. Cann't be the best answer could be from multiplying non continuous matrices like multiplying matrix A and D , B and C and then [AD] * [BC].

[@gauravbanerjee2898]

Thank you so much striver ❤❤

[@codelearner3355]

UNDERSTOOD ,THANKS!

[@gentleman7060]

All of your dp problems should have one playlist. It would be helpful.

[@arnoldsmith6584]

It is there bro in a single playlist

[@AbhishekYadav-rm4hw]

shouldn't the base case be if(j==i || j==i+1) return 0; as when j = i+1 then also there is only one matrix which is possible and then also we can't multiply. Edit: I appologize, I got it now

[@raghavmanish24]

MJHE BELEIVE NHH THA PHLE KI MAI YE TOPIC SMJH LUNGA EK BAAR ME .....BUT STRIVER MAKE IT EASY ......#UNDERSTOOD

[@Zunan263]

Thanks a lot man plz donot stop ur series today there might be very less reach imagine after 6 months u will get shocked by reach just plz donot stop posting vedios

[@ektabansal7645]

Thanks a lot striver for this series, it is damn helpful!!

[@abhisheksinghdangi5027]

I have seen, revised twice the entire series till now and maybe will continue with this part later coz companies dont ask this hard for frwshers here.

[@UCSDebajyotiDas]

The code studio question is little bit changed now f(1,n,arr) will work instead of n-1

[@cricketwala937]

this is the best lecture on MCM till the date . 🔥🔥🔥

[@michael-pasquale]

Understood. Excellent explanation!

[@prabhakaran5542]

Understood ❤❤❤

[@CoderSlot]

Hey striver ,i just come across to check your memorization code available at article of the same problem in dsa list and found that their is an error in your code as although you are checking for availability of precomputed (i,j) in dp by this : if(dp[i][j]!=-1) but you forget to update it at the end with the value you are returning i.e. return dp[i][j]= mini;

[@vishwasrajbatham5998]

Understood. Helped a lot !

[@JohnSnow-r1e]

Give this guy 10M subscriber by the end of the 2024

[@sukhpreetsingh5200]

Awesome Just amazing lecture😃

[@smartswaggy6114]

grt video man! hats off to your efforts. Btw i guess the time complexity will not be n cube, it will be exponential.(n power n power n i guess). because in rec tree we are branching according to the size of the partition.

[@culeforever5408]

Love you man

[@Zunan263]

Plz plz plz dp on graphs asap love ur work 🙏❤️

[@vidhigupta3769]

understood. Thanks Striver!!

[@TON-108]

Understood!

[@anukulgaurav3043]

Best video I have ever seen on dp🔥

[@animeshkumar2683]

Understood

[@blurrybrush1010]

finally,thank u striver for this series

[@ayonsinha2075]

bhai can you please tell me why i*j =n*n.....j==n that got it but why i is n

[@rishabhagarwal8049]

Understood Sir, Thank you very much

[@bhavanisankarlenka]

understood

[@prantikofficial]

Understood completely!

[@sainenirohitrao5083]

man justt love youuu...completely understoood!!!

[@shubhadarajmane7323]

Thanks ,you helped me a lot.

[@bishalpandit4464]

Great video! With great explanation

[@rakeshkumaryadav1117]

How did you decide in tabulation i from n-1 to 0 and J= i+1 to n-1 Why j is not from n-1 to i or i from 1 to n-1

[@akashsri3]

The thing about him that his so authentic is that he actually solves the problem at point of time he does not not memorize the solution and show

[@TXS-xt6vj]

Legend , legend, legend

[@ashishchourasia2830]

Hands down the best explanation.

[@parthsalat]

I'm blind...how am I supposed to watch this insightful lecture 🥺

[@chandrachurmukherjeejucse5816]

Solved the question after watching just 15:43 all thanks to striver ❤

[@shalomalexander7811]

Which application are you using to write on?

[@anonymousvoid6356]

Dont stop making videos man !!!!!!!

[@ratinderpalsingh5909]

Understood, sir. Thank you very much.