Matrix Chain Multiplication Dynamic Programming

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, you will learn about Matrix Chain Multiplication problem using Dynamic Programming. In this question :
1. You are given an array(arr) of positive integers of length N which represents the dimensions of N-1 matrices such that the ith matrix is of dimension arr[i-1] x arr[i].
2. You have to find the minimum number of multiplications needed to multiply the given chain of matrices.

[ashwinvarma]

I always prefer your videos over others' for the depth you cover. Great explanation sir once again!!

[chandrakantshinde]

perquisite for this problem is Palindrome partitioning problem and for Palindrome partitioning problem prereq. is Rod cutting problem, this series itself DP 😂😂🔥🔥, depend upon previous state

[yashCeo]

The explanation was great as always sir. I would recommend including a recursive approach too in the video. If in an interview we directly give DP solution the interviewer might think ki ratt liya hai bande ne.

[harshshukla]

Thank you very much Sir. Best explanation. Bahut acha padhaate hai aap. You value your viewers.

[aritralahiri]

Wonderful explanation once again . Love the way you go in the very depth of every problem . Thanks a lot Sir !

[rakshitdevra]

Hats off sir for such dedication towards teaching.

[karthikrashinkar]

please rearrange the playlist properly sir, I don't know where gap strategy is explained. Im watching video according to playlist. 🙏🏾🙏🏾🙏🏾🙏🏾

[kirtimaangogna]

Hello sir, Kya aap abi sirf DP k questions complete karoge ya sath me parallel me aur koi topic b karoge ?
Agar ap koi aur topic parallel me karoge to uska nam bata dijiye taki wo dusre source se parh k time waste na karen ham,
Thank you so much for this awesome content.

[HappyHappy-ihzp]

subscribe bhi kr dia and bell notification bhi dba di. Great Content Sir Thank You very Much.

[mickyman]

sir ye questions ko yaad krna pdega kya, kyuki iska method kahi aur nhi lgta hai aur easy to visualise bhi nhi hai

[mdnazirhusain]

Brust ballon problem solve krne k liye Matrix chain problem dekho ar Matrix chain problem ko solve krne k liya pallendromic cut wali video dekho ye ksa endless loop h😂😂

[ZentrexGaming]

Sir, Maza aa gaya. Kya mast samjhate ho aap yaar. LITERAL GOD. I hope god bless you and your family. MAST VIDEO <3

[ankushmilan]

Can someone please tell me what is the first video in which gap strategy is been taught?

[ArcGamingYT]

is there solution for above with n² complexity

[priyanshukhullar]

Great sir burst balloon bhi post kijiye sir jldi . Aapse sikhna hai

[deeksha]

Thanks a lot, Sir for this amazing explanation.

[ashutak]

How did you decide you are going to use Gap Strategy, could you please also explain, where this one becomes different from Longest common subsequence, or how many other ways will be there to solve this problem.

[rohandevaki]

working sir, thanks for the great explaination .

[umangbehl]

as soon as i see your video i ignore others and click on it because you drill the concepts in the head

[schwarzenneger]

Sir aap live kyu nhi aate ajkal ? (9pm wala)