Matrix Chain Multiplication using Recursion | MCM

preview_player
Показать описание
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.

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:

=======================================================================

USEFUL LINKS:-
MCM:

#mcm #dp #recursion
Рекомендации по теме
Комментарии
Автор

Why hasn't youtube recommended this channel Best explanation sir

manir
Автор

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

Avinash_kumar_IITD
Автор

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.

prashantpareek
Автор

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

vedanam
Автор

Hands down best explaination. Good going sir!

yashbhanushali
Автор

great explanation bhaiya, jawab nhi apka

abhishekjaiswal
Автор

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 ❤️

rohitbhowmik
Автор

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

Sunil-xzek
Автор

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

richmondmensah
Автор

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

NikhilSharma-mvhq
Автор

God level explanation. Many many thanks sir

ritwik
Автор

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

abhishekjaiswal
Автор

Very very very nice Video and Explanation !!!

naman_goyal
Автор

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.

yushdecides
Автор

Seriously nice session ❤️😊.
Thanks for sharing 😊

kunalsoni
Автор

What will be time complexity of recursive ???

ujjwalmittal
Автор

This is so tough compared to other DP Questions :(

RahulKumar-wfxx
Автор

what will be time complexity of recursive solution of mcm

hritikkhurana
Автор

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

raghavsaboo
Автор

please show how to do DP of this also.

amitavamozumder