Matrix Chain Multiplication using Recursion | MCM

This video explains all the concepts of matrix chain multiplication using recursion.This video covers everything you need for solving this problem.In this video, I have first explained the mathematical concepts required for this problem and then I have shown the approach and intuition for understanding the method to solve the problem.I have used multiple examples to make the concepts easy to understand.
HELP us by donating on patreon: / techdose
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
========================================================================
Join this channel to get access to perks:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
USEFUL LINKS:-
MCM:
Balloon Burst Problem: • Balloon burst problem ...
#mcm #dp #recursion

[@manir7251]

Why hasn't youtube recommended this channel before...... Best explanation sir

[@techdose4u]

Thanks :)

[@dailyclipmafia5041]

algorithm

[@Avinash_kumar_IITD]

hey i watched ur all videos on MCM and in "ORACLE" interview they asked the same qn, and i got selected.
thnx man

[@prashantpareek5863]

you are the only man who has understood the problem of the color-blinds in the tech problem solutions videos while explaining, dhanwaadagalu anna,eetara ne videos maadtairi,naav noodtairtivi.

[@techdose4u]

😊

[@vedanam5195]

At 27:16 , temp my current cost ki first value I think arr[L-1] ayegi.. instead of are[L]

[@varunreddysuddala1650]

yea bro its l-1

[@abhishekjaiswal6492]

great explanation bhaiya, jawab nhi apka

[@techdose4u]

Thanks 😊

[@yashbhanushali8456]

Hands down best explaination. Good going sir!

[@techdose4u]

Thanks :)

[@coderpriyabrat3585]

Thanks for this details teaching ❤️

[@CSKAASIPRASANTHA]

Literally Excellent explanation sir 👏

[@Sunil-xz7ek]

Your channel will grow faster than other channels.Way to go sir.

[@richmondmensah4408]

@TECH DOSE Great explanation!
At 26:25 should it be arr[L - 1] instead of arr[L]?

[@Shailswap14]

ya it should be arr[L-1], he has corrected that in memoized version

[@NikhilSharma-mv8hq]

Dude such a great explanation man 😵😵
Such a gifted teacher u r 🙂

[@techdose4u]

Welcome :)

[@rohitbhowmik464]

Great explanation sir... I have already seen many videos.. But my concept was not clear... This video is very helpful for me... Now my concept is clear.... Thank you sir ❤️

[@venkatasaipreetamkotteda9388]

Hope you get millions of subscribers

[@sourabhraghav7642]

Man, you explain amazingly

[@naman_goyal]

Very very very nice Video and Explanation !!!

[@techdose4u]

Thanks

[@ritwik121]

God level explanation. Many many thanks sir

[@iSumitYadav]

You are awesome bro!!!

[@techdose4u]

Thanks :) I wish these lectures help you.

[@abhishekjaiswal6492]

can you please tell me the time complexity and space complexity of this approach?

[@kunalsoni7681]

Seriously nice session ❤️😊.
Thanks for sharing 😊

[@techdose4u]

Welcome :)

[@aditisharma1473]

Best explanation out there!

[@ujjwalmittal3785]

What will be time complexity of recursive ???

[@yushdecides]

Bro, also add those questions of dp in which we have to fill the 2 dimensional dp table in diagonal fashion and at last we have to return the value dp[0][m-1].
Also plz tell us how to identify these type of questions.

[@techdose4u]

I will try. I have already marked some leetcode problems which I will be covering. I hope it will clear all the doubts. Still MCM has Memoization and Tabulation video left. After that I will start problems.

[@sumandas5563]

Best explanation sir. Very helpful.

[@올롱볼롱]

The bset of the best.

[@raghavsaboo2190]

Amazing Explaination

[@techdose4u]

Thanks

[@RahulKumar-wf9xx]

This is so tough compared to other DP Questions :(

[@hritikkhurana5312]

what will be time complexity of recursive solution of mcm

[@raghavsaboo2190]

In coding interviews what solution in expected recursive or iterative?? wrt dynamic programming

[@techdose4u]

Anything is fine. While coding do iterative and while explaining recursive is easier to understand.

[@amitavamozumder73]

please show how to do DP of this also.

[@techdose4u]

Please watch the subsequent videos man. Everything is explained

[@amitavamozumder73]

@@techdose4u yeah found it, thanks

[@Krishnash1355]

how can tc be n^3??

[@Fictional_universe]

and mcm using dp idea??

[@techdose4u]

It will come next.

[@Monect_Tuber001]

0:34 Its not a/b and c/d its a into b(a*b) and c into d (c*d)

[@ahmadbodayr7203]

Raed About Islam people❤