Thank you Sir for taking the hardship for making all of these well-explained Video Lectures. You deserve a lot of Respect for your hard work. Thank you!!
jump to 16:49 those who are here just for Print Algo. Abdul Bari sir you are one of the most awesome teachers I have learned from, thanks for publishing excellent quality videos.
I think it would be better to set "m[i][j]" to -1 before the 3rd loop and then check if(q < m[i][j] || m[i][j] == -1) Theoretically it would be best to set "m[i][j]" to infinite but practically -1 is easier to use.
@@shauryavardhan9206 as per said by Abdul sir in the description there is the piece of code but I couldn't find it...can anyone Please send the code in comment reply section here ?
Sir I think this can also be done by a recursive method, I mean whichever cost is found to be min. In the beginning should just be multiplied and then again recursively called for (n-i) no. of arrays where (i) is no. of times multiplication has already been done... And Thank you it was because of binge watching ur videos that I was able to think towards this approach...
Thank you Sir.Your efforts are really very helpful and we are benefitting from your way of teaching.Looking forward to many more videos on your channel.
Given a set of non-negative distinct integers, and a value m, determine if there is a subset of the given set with sum divisible by m. Input Constraints Size of set i.e., n
Compared to others making similar videos, he's quite elaborate even though slow. For beginners, it is perfect.
yep
One of the best teacher. Thank you Sir. God bless you and your family always.
Thank you Sir for taking the hardship for making all of these well-explained Video Lectures. You deserve a lot of Respect for your hard work. Thank you!!
One can understand completely matrix chain multiplication with these two videos Outstanding... awesome.
We had this same exact example in class and I understand where the 88 and 104 came from now. Thank you!
best teacher i have ever found on earth , love you sir always❤❤❤❤❤❤❤❤❤❤
jump to 16:49 those who are here just for Print Algo.
Abdul Bari sir you are one of the most awesome teachers I have learned from, thanks for publishing excellent quality videos.
This channel deserves the most subscribers because these video lectures are among the best channels for CS
I think it would be better to set "m[i][j]" to -1 before the 3rd loop and then check if(q < m[i][j] || m[i][j] == -1)
Theoretically it would be best to set "m[i][j]" to infinite but practically -1 is easier to use.
Sir, your explanation is awesome. most simplest, yet highly effective. hats off to you Sir!!!
Thankyou
sir the code u have has bug because of 2 way recursion while printing u gave cout
whaeere is the code bro
super easy program!! this topiic takes my long time to understand and u make it so easy to understand. thanks alot sir!!
Thank you for the video sir! But can you please put the code in the description?
pretty easy compared to the code of multistage graph, thank you for explaining it so well
Nice explanation Sir!! But the code is not present in the description box can you pls add it?
Hy senior 😸
Sir, your voice is pleasing.
Sir Iska source code description me nahi hai.
very good explanation. but one minor issue
k should start from i instead 1.
for(k = i; k
Please look carefully in the code... it is ' i ' not 1. :)
Thanks.
@@shauryavardhan9206 as per said by Abdul sir in the description there is the piece of code but I couldn't find it...can anyone Please send the code in comment reply section here ?
sir you are awesome ...far better than tushar roy...you are my online guru and goto person for algorithms...very much thankful
Best explanation So far on youtube
This man is genius ❤
in the program there should be k = I thanks sir u r amazing
as Simple as it can get. Thanks for this explanation!!
thanks for the course. Sir you have mentioned, code is in description. Not able to see any link for code.
k loop should start from i and should end at j-1. please update if possible
Holy cow the code is beautiful
Sir truly super. One issue i don't find program in description any idea where I can get?
How to find which value of 'q' is minimum
Amazing videos and explaination! Thank you, sir!
Sir I think this can also be done by a recursive method, I mean whichever cost is found to be min. In the beginning should just be multiplied and then again recursively called for (n-i) no. of arrays where (i) is no. of times multiplication has already been done...
And Thank you it was because of binge watching ur videos that I was able to think towards this approach...
But time complexity will be high
Sir, its a nice video to understand "Ordering matrix multiplication" , but in exam how they ask question? to solve "Ordering matrix multiplication"...
sir plz create advanced data sructures like fenwick splay trees and more
Thanks for all the video on matrix chain multiplication, very helpful.
the sequence print can be resolved by
if(s[l][h]==0)
{
if(l==(n-1)&&h==(n-1)){cout
#include
using namespace std;
void inorder(int s[][5],int l,int h,int n)
{
if(s[l][h]!=0)
{
cout
Thank you Sir.Your efforts are really very helpful and we are benefitting from your way of teaching.Looking forward to many more videos on your channel.
Abdul Bari
Reduction problems in NPC or approximation algorithms
Convex hull
Red black trees
Or any other topic you think is interesting or important
This is fantastic. Thank you for the explanation and examples.
where is code ,as u said it is in description but in description there is udemy course link
Thank you soo much sir..very well explained 🤍
Thank you for the teaching. I knowed it finally! Thank you!
why is min = 32767 initially??
Very helpful video! Thank you so much Abdul Sir!
There is no code in the description
where I can find the Inorder Traversal Code?
How is this inorder traversal?
can I ask why we assign that "magic number" to min?
Add any largest number possible
sir plz explain algorithms of edge finding for images
that is a typical algorithm and different from this. Andrew Ng has a video on edge detection for images. Watch it.
Perfect explanation in an intuitive way...Thanks a lot sir
Sir the link in the description is not working...please provide proper link...so that I can understand and learn it
Thanks sir. you'r video so helpful for me....
Sir code is not available in the desc. Requesting you to kindly upload it.
sir where is the program its not in the description
why is there a line of code that says min=32767 ??
i have the same questions
@@changguiqian7794 Maybe for just initialising,to begin comparing
See what i is doing in loop.
It is keeping track of row in which we want to compute the value.
Say i=1,j=2
Now q will contain 120
120
Code kha s milega ye description m ???
Thank you for your hard work.
where is the code?
Sir parenthesis find out karna ka algorithm ki link de do....the link in the description is not working
Sir the link is not opening to the code
where is the code
its not in the description
seems like the program link is not working.
shouldn't the k loop start from i ?
Sir there is no code in the description
exactly no code... Has sir put it anywhere else bro?
Thank you so much sir, the explanation is so amazing!
Can u make video on matrix multiplication with variable order with random fixed point and floating point value . Plz explain it ,I need
why min= 32767 is written in the code
Salute hai sir aapko
Sir why min=32767???
Why min=32767
Best playlist!
Anyone who didn't understand how the S matrix is filled, please check the next video to fully understand it
mind blowing explanation,sir
thanks sir
Sir even this code is compile in turbo c++
where is code
@@MohdSalman-hm3zc follow the brocode channel in which they explain algorithm with code very deeply
ty sir i am algo now
Thank you for explanation!
I hate dynamic programing
+1
+1
Awesome! tutorial
the link is wrong i think, I can't find the code. please help
hwo can we use the S table to actually parenthesize our matrices correctly? Can someone help bcoz i'm finding it difficult to code it out?
Follow this algorithm:
if i == j
print “A”i
else print “(”
PRINT-OPTIMAL-PARENS(s, i, s[i, j])
PRINT-OPTIMAL-PARENS(s, s[i,j] + 1, j)
print “)”
thank you sir ........ nyz video
144 < 158 in m[1][4] calculation
it is 244 not 144.
@@Vikaskumar-cw3lx my bad, thank you
nice explanation vp!
Where is code
where is the code can anyone send it to me?
Nice explanation
Thank you So much sir,
Because of you I am gaining some valuable knowledge.
If i code it in codeblocks.ans is-142.. but why!😥
Why min=32767?
Can by any value, we are just taking a very big value to find minimum
You are the best!!!
really great.
you are a legend
Thank you sir!
very helpful
where is the source code?
Given a set of non-negative distinct integers, and a value m, determine if there is a subset of the given set with sum divisible by m.
Input Constraints
Size of set i.e., n
the code download link is not working sir..!
can you give it on the comment please..?
Abdul Bari sir can you give the code here please?
Thank You Sir
everyone there is a mistake in the code
k should start from i not 1
Thanks for the code.
where is the code ??
Thank you!
thank you so much!
thnx sir
Thank u sir