Matrix Chain Multiplication using Recursion | MCM

Поділитися
Вставка
  • Опубліковано 30 вер 2024
  • 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

КОМЕНТАРІ • 50

  • @manir7251
    @manir7251 3 роки тому +26

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

  • @vedanam5195
    @vedanam5195 3 роки тому +16

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

  • @Avinash_kumar_IITD
    @Avinash_kumar_IITD 3 роки тому +13

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

  • @richmondmensah4408
    @richmondmensah4408 3 роки тому +9

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

    • @Shailswap14
      @Shailswap14 3 роки тому +1

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

  • @prashantpareek5863
    @prashantpareek5863 2 роки тому +6

    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.

  • @ujjwalmittal3785
    @ujjwalmittal3785 3 роки тому +1

    What will be time complexity of recursive ???

  • @abhishekjaiswal6492
    @abhishekjaiswal6492 3 роки тому +3

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

  • @abhishekjaiswal6492
    @abhishekjaiswal6492 3 роки тому +2

    great explanation bhaiya, jawab nhi apka

  • @yashbhanushali8456
    @yashbhanushali8456 3 роки тому +4

    Hands down best explaination. Good going sir!

  • @yushdecides
    @yushdecides 3 роки тому +2

    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
      @techdose4u  3 роки тому +4

      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.

  • @RahulKumar-wf9xx
    @RahulKumar-wf9xx 3 роки тому +2

    This is so tough compared to other DP Questions :(

  • @coderpriyabrat3585
    @coderpriyabrat3585 3 роки тому +2

    Thanks for this details teaching ❤️

  • @hritikkhurana5312
    @hritikkhurana5312 2 роки тому

    what will be time complexity of recursive solution of mcm

  • @Sunil-xz7ek
    @Sunil-xz7ek 3 роки тому +1

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

  • @venkatasaipreetamkotteda9388
    @venkatasaipreetamkotteda9388 3 роки тому +1

    Hope you get millions of subscribers

  • @Monect_Tuber001
    @Monect_Tuber001 Рік тому

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

  • @CSKAASIPRASANTHA
    @CSKAASIPRASANTHA 2 роки тому +1

    Literally Excellent explanation sir 👏

  • @raghavsaboo2190
    @raghavsaboo2190 3 роки тому +1

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

    • @techdose4u
      @techdose4u  3 роки тому +1

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

  • @kunalsoni7681
    @kunalsoni7681 3 роки тому +1

    Seriously nice session ❤️😊.
    Thanks for sharing 😊

  • @ahmadbodayr7203
    @ahmadbodayr7203 Рік тому

    Raed About Islam people❤

  • @Krishnash1355
    @Krishnash1355 2 місяці тому

    how can tc be n^3??

  • @NikhilSharma-mv8hq
    @NikhilSharma-mv8hq 2 роки тому +1

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

  • @iSumitYadav
    @iSumitYadav 3 роки тому +2

    You are awesome bro!!!

    • @techdose4u
      @techdose4u  3 роки тому +1

      Thanks :) I wish these lectures help you.

  • @rohitbhowmik464
    @rohitbhowmik464 3 роки тому

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

  • @naman_goyal
    @naman_goyal 3 роки тому +1

    Very very very nice Video and Explanation !!!

  • @올롱볼롱
    @올롱볼롱 2 роки тому

    The bset of the best.

  • @ritwik121
    @ritwik121 3 роки тому

    God level explanation. Many many thanks sir

  • @sumandas5563
    @sumandas5563 3 роки тому

    Best explanation sir. Very helpful.

  • @amitavamozumder73
    @amitavamozumder73 3 роки тому +1

    please show how to do DP of this also.

    • @techdose4u
      @techdose4u  3 роки тому +1

      Please watch the subsequent videos man. Everything is explained

    • @amitavamozumder73
      @amitavamozumder73 3 роки тому

      @@techdose4u yeah found it, thanks

  • @Fictional_universe
    @Fictional_universe 3 роки тому +1

    and mcm using dp idea??

  • @raghavsaboo2190
    @raghavsaboo2190 3 роки тому +1

    Amazing Explaination

  • @aditisharma1473
    @aditisharma1473 3 роки тому

    Best explanation out there!

  • @sourabhraghav7642
    @sourabhraghav7642 3 роки тому

    Man, you explain amazingly