DP 48. Matrix Chain Multiplication | MCM | Partition DP Starts 🔥
Vložit
- čas přidán 26. 02. 2022
- Lecture Notes/C++/Java Codes: takeuforward.org/dynamic-prog...
Problem Link: bit.ly/3nXqfce
Pre-req for this Series: • Re 1. Introduction to ...
a
Make sure to join our telegram group for discussions: linktr.ee/takeUforward
Full Playlist: • Striver's Dynamic Prog...
In this video, we solve the MCM Dp, this is the first problem on the pattern Partition DP.
If you have not yet checked our SDE sheet, you should definitely do it: takeuforward.org/interviews/s...
You can also get in touch with me at my social handles: linktr.ee/takeUforward
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 .
*Important timestamps*
1. Quick Revision: 41:50 (and 24:45)
- No of steps to multiple 2 matrices: 31:40
2. Recursion code: 47:39
3. Memoization code: 51:45
Thanks. I would suggest anyone who has even a little idea about MCM(I did) to only see the video from 41:50. Before that is unnecessary for if you already know about the basic outline of MCM.
👏👏👏 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 ✌
arey aaram se bolo didi, ye beech beech mei daure pad rhe h kya!
@@momozkichutney 🤣🤣🤣🤣
@@momozkichutney wo stree h k6 v kr skti h 😂😂
Lgta hai didi zyda moody hai bich bich itna mood swings 😂
ye kya bawasir likh diya be
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 ❤️❤️❤️❤️
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
@@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 .
@@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
Its been 6 years since I came across this topic and finally understood it today
you've been unemployed for quite some time 😆
@@trijalsharma4471 solving a damn specific problem doesn't mean you are smart buddy.
That's the best video ever on Partition DP 👏 so much effort goes into making such content for generations, hats off man 👏👏
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.
I tried it multiple times earlier but now I got better understanding, indeed it will stuck in my mind now.
Another great video, thanks striver for making me understand MCM
50 minute sound huge but it just flew by
TBH for dp series Aditya Verma & you are the best. 😊
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 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
thanks gyani baba@boomsi69
my goodness!! crystal clear explanation I am grateful for your dp series, thank you, Striver.
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.
Really nice explanation srtiver. I like the way that you teach and understood the MCM.Very tricky but now understood.
UNDERSTOOD...Thank You So Much for this wonderful video.......🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
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.
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❤❤
understood that is not a question this a concept ....
hats off to your efforts man you are just amazing
What an explanation....Partition was a concept i was not much clear with .....
Thank you for making me understand this concept
The best video on partition DP I came across! Good job!
Just understood the whole concept of partition DP at one go 🙌😌🔥
Thanks a lot striver for this series, it is damn helpful!!
Understood! Thank you sooooo so SO much as always!!
Thank you soo much!! Please, keep posting such this amazing content!
Got it when going through coluple of times thanks a lot !!!
Best Ever Explanation for MCM. Literally!
Excellent explanation - Partition DP Starts!!!
Understood
------------------------------
Recursion :-
TC---> exponential
Memoisation:-
TC---> O(N*N*N)
SC--->O(N*N) + O(N)
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.
I have not seen such good explaination for this problem bhaiya, thanks for making such good conceptual problem!!
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.
❤️
I also
AMAZING EXPLANAITION AS USUAL!
Understood.🔥🔥Your dp series is best.
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.
Very clear and solid explanation,Thanks buddy
thankyou bro, very clear and easy explaination .
@striver Great explanation ... hope you will making a video on burst ballons and how to think for that problem ...
Give this guy 10M subscriber by the end of the 2024
MCM was always been a nightmare for me, and now, I finally understood. Thank you so much bhaiyaa!! 🙏🙏🙏🙏
Understood! very well explained
It's hard but u have made it very easy to understand thanks bhaiya 😃😍
It takes a lot of effort to explain more than one example in detail. Thank you so much for this.
this is the best lecture on MCM till the date . 🔥🔥🔥
Thankyou for amazing solution Striver
Nice tricks for solving all partition dp
awesome lecture striver , understood
kya mast padhaya hai.....aapko dekhke mera khud padhane ka man hogya...❣❣❣❣❣❣
Thank You
Understood!!!
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...
very calm and easy solution . thanku u striver
Hi Striver, can you explain problems on pattern dp like burst baloons etc. Your explaination is very good btw.
Soon!
@@takeUforward jaldi le aao bhaiya, can't waitt!
Understood Thank you so much
UNDERSTOOD ,THANKS!
No one can be better than you striver
Understood. Excellent explanation!
Thank you so much striver ❤❤
Thanks ,you helped me a lot.
Amazing! understood
man justt love youuu...completely understoood!!!
Absolutely world class
Great video! With great explanation
Just like messi, no one can be better than this teaching, so underrated
Understood. Helped a lot !
Clearly understood, thanks!
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
areeee bhaiyaaa omphooo!!! zammmn bhai understood....saying this video is god damn amazing is an understatement.
Dont stop making videos man !!!!!!!
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
Love you man
Understood , difficult concept explained easily🤯🤯
Thanks a lot for such a wonderful explanation sir :)
The Great Rohit Negi is here!
Super Clear Understood.
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;
Hats off 💯
Please tell me how do i apply formula arr[i-1]+arr[k]+arr[j] on BCD recursive call because i is set to 0 index on BCD call
I found the solution which is that actually the whole array is passed in all the recursive call only pointer are moving that is i and j so there will always a arr[i-1] present in all the calls thats all.
I'm blind...how am I supposed to watch this insightful lecture 🥺
Plz plz plz dp on graphs asap love ur work 🙏❤️
The code studio question is little bit changed now f(1,n,arr) will work instead of n-1
Legend , legend, legend
Understood!
Best video I have ever seen on dp🔥
Understood ❤❤❤
Understood, sir. Thank you very much.
Understood completely!
All of your dp problems should have one playlist. It would be helpful.
It is there bro in a single playlist
Understood ❤
Hands down the best explanation.
understood. Thanks Striver!!
understoodd!!!
Understood Sir, Thank you very much
Understood.
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
UNDERSTOOD
pure gold!
Understood
Understoos!
BEST👏
understood
thanks sir
understood sir
understood.