The gold content are bhai tera channel dhundh raha tha fir yaad aya ek saal pahile mene matrix chain multiplication ka tera video dekha tham for wahi search Kiya . Thumbnail mein tu dikha to confirm hua wahi channel hain. Bhaut accha hain channel😊
Other than already omni-cherished methodology he uses to teach, I am blown by subtle swagger of this guy at moments! kaafi kool ekdum jhakkas bohot honhaar!
bhaiya itna logic koi bhi free main nahi bata jaise aap kar rahe ho ... aapko bhi koi help kiya tha apke time pe jab aap college student the aur we are really special to have this type of amazing content ..thank u bhaiya
@@TheAdityaVerma really u learnt these all without online or offline coaching classes or without any help from good programmer. ....all self taught!!!!
@Aditya Verma. Can u pls share list of problem variations for other DP topics like LIS, Grid , kaden's, fibonacci and others for which videos are not made so that we can practice on our own. It will be very helpful for us.
Aditya bhai, you must be one of the rare people jinko ye 10-15 dislikes dekh kr maza aata hoga Kyunki sbko pata hai ye dislikes Tushar/Jenny/wagera ke hi hain..😂 Anyways, Tagda content!
Bhaiya Please comple this DP playlist. after learning every concept from your video, no other videos explanations are suiting me Apne toh apne explanation ka adat Laga diya aur aese Beech meh khatam krdiya DP...LIS Knapsack and bht sara topic baki hai bhaiya please complete it. your explanation is LIT
Hey @Aditya Verma thanks a ton for this amazing series. Can I use this concept(MCM) to solve maximum sum bi-tonic subsequence. If yes, could you guide me on how to approach it. Thanks again, keep up the amazing work. Cheers!
@@TheAdityaVerma bro, we know you will have your reasons for not completing the playlist... But can you please complete it as soon as possible. Anticipating for the complete playlist as much as we anticipated for Bahubali2!!!
Since i has been taken to be the left index and j to be the right index, hence, its obvious that i should always be j, it means the left pointer has crossed the right pointer which is impossible according to what we have taken. Again, this would differ wrt question which he mentioned, but for this case, it stands invalid for i>j. Its quite similar to what we do in binary search. As soon as the left pointer crosses the right pointer, we break the while loop. Same is happening here.
Other TH-camrs : Take two variables i and j
**Le Aditya :
i Aur j ki staphana Ho gyi... 😂😂😂🙌
😅😅
@@TheAdityaVerma bhaiya please baaki topics v cover krwa do
It's amazing how he has come up with a general format for no. of questions in MCM. Tells how much he has researched on it.
talent😅
@@yashwanththati1001 hard_work,none has talent
@@RohitKumar-fy9fp i agree for the hardwork part but saying none has talent is a wrong statement. Think it and observe around you deeply.
When are your other playlists coming ...never waited so much for any other channel :-)
Angrazo ne bahut kuch miss kar diya ...bahut sahi samjhaya hai..to the point and crystal clear .
Thanks for your effords man
Regards
Ivy schools mai hazaro dollar spend karke bhi aise explanation nahi mil paye ga 👌
the format that you explained is pretty solid. Thoroughly enjoying your videos. Keep it up.
Much appreciated!
32 of 50 (64%) done! Very nice explanation of the format of parent MCM pattern.
bas kr bhai, yha kyu bta rha h
jal rhi bc@@Lifeisgood108-33
U can make a udemy course just out of this playlist if you want . Just subscribing and recommending the channel didn't feel enough .
No show off, no fancy style, just simplicity. Awesome explanation in each and every video brother. ❤️ ❤️
yes 😅
i guess u r one of those few people who does thorough research before teaching what a humble and hard working guy RESPECT DUDE:)
It is requested that you complete this playlist with the other variations too. You teach so well!
Yes same @Aditya Verma
A wise man once said, if you want to learn anything you can do so freely with best resources. This channel proves his point. Awesome explanation.
printing mcm and other are missing from playlist...please at least make short single video on all missing topics.......
Nicely explained such a hard topic !!
Glad you liked it
Now I'll never forget (i to k) and (k+1 to j)
Awesome explanation !!
Hey Aditya, you can't imagine how grateful we are. Thanks man. Just one request, if you get time pls make similar playlist on graph problems.
Yes
You can get good article on Graphs on leetcode.
@@rahulgunkar6308 can u share the link??
Hey Aditya, please complete the problems from the list you previously mentioned. Thank you so much.
Bhaiya bohat shandaar samjate ho aap . Please Iss playlist ko complete kar do . Jo bhi topics missing hai. Thanks a lot
Your attitude towards summing up of prior explanation is respectful. Thanks!
Continuing to this series, started to like first then ending the video.. Kudos for your explanation
bhai actually the way u make people understand is too good , i seriously like ur approach , good job buddy
The gold content are bhai tera channel dhundh raha tha fir yaad aya ek saal pahile mene matrix chain multiplication ka tera video dekha tham for wahi search Kiya . Thumbnail mein tu dikha to confirm hua wahi channel hain.
Bhaut accha hain channel😊
Your explanations motivate us to study DP
!!!!!!!!!!!!!!
Sir ur teaching style is excellent.Recently i studied 0/1 and unbounded knapsack.
pls make video on LIS asap!! Ur experience is helping me much.
All bow down to the best dp teacher in youtube. I feel sorry for those who cant understand and speak hindi.
Love your content bhai ❤when I need revision I blindly open ur video
This playlist is too good. Please upload videos of grid DP also
Thank you very much. You are a genius.
Maja agya bhai.. U have a unique n interesting way of teaching 😍
Chellam Sir of DP
please continue this playlist it would be really helpful, the way you teach is remarkable as you made dp look easy
waiting for backtracking , greedy and other important playlist ❤.
Other than already omni-cherished methodology he uses to teach, I am blown by subtle swagger of this guy at moments! kaafi kool ekdum jhakkas bohot honhaar!
jyada english mat jhaad jhaatu
bhaiya itna logic koi bhi free main nahi bata jaise
aap kar rahe ho ... aapko bhi koi help kiya tha apke time pe jab aap college student the
aur we are really special to have this type of amazing content ..thank u bhaiya
Ni yaar !! All of this is self taught !! And yeah thanks !!
@@TheAdityaVerma really u learnt these all without online or offline coaching classes or without any help from good programmer. ....all self taught!!!!
Truly Amazing content. Keep it up bro.
@Aditya Verma. Can u pls share list of problem variations for other DP topics like LIS, Grid , kaden's, fibonacci and others for which videos are not made so that we can practice on our own. It will be very helpful for us.
Hey did you find out any yt channel covering this ping it here please 🙏
Me too looking for it.
try cses problem set or atcoder educational dp contest , there are good problems
@Arati Rauniyar if u had find those plz can u share?
If found plz share
One word - Amazing
Aditya bhai, you must be one of the rare people jinko ye 10-15 dislikes dekh kr maza aata hoga
Kyunki sbko pata hai ye dislikes Tushar/Jenny/wagera ke hi hain..😂
Anyways, Tagda content!
Bhaiya Please comple this DP playlist. after learning every concept from your video, no other videos explanations are suiting me Apne toh apne explanation ka adat Laga diya aur aese Beech meh khatam krdiya DP...LIS Knapsack and bht sara topic baki hai bhaiya please complete it. your explanation is LIT
Bhaiya bhaut bdia pdate ho... Apka bhuat bhaut dhanyavaad. ✌🙂🙂
Divide and Conquer + Memoization = Matrix Chain Multiplication
correct??
Sir, if you have notes please upload sir , we can practice along with your videos , that might help for beginers
please do a playlist on trees and graphs
God level analysation
10:55 maine banaya he !! lol !! bolne me burai thodi . Great vids !! Definetely sharing with others.
Bhaiya apki vdos bahut achi hai ...Plz dp ke other variations aur LIS pe vdos bana do
it 's logic sounds like merge sort when it comes to call function.
Function ka naam kuch genuine naam rakhte hai "Solve", gazab humour :D
i feel that floyd warshall algorithm is in MCM format am i right ??
Please make a playlist on Graph Algorithms !!!!
Thank you so much bhaiya...you saved me
These lectures are gold!
Your confidence level 🔥🔥
Awesome videos..Thank you
amazing explanation !!
please make a video on longest palindromic substring
agar MCM is bhaiya ka dpFavourite ... toh mera bhi wo ab favourite Parent DP Problem 🥰 #nutanix
Bro you are the best
after watching 33 videos ,
Le inner me : aaj see top down bottom up and bottom-up top down xddd
haha
sir please make such a playlist on famous divide and conquer problems like convex hull etc
Thank you so much.
GRAPHS par bhi playlist bana do bhaiya ji 🙌🙌
Loved it!!
Hello! i have a big confusion.... Recursion+memoization == Top down approach?? but you said it is bottom up??? Please clear me!
Great video man
Well done bhaiya!!!!
Hey @Aditya Verma thanks a ton for this amazing series. Can I use this concept(MCM) to solve maximum sum bi-tonic subsequence. If yes, could you guide me on how to approach it. Thanks again, keep up the amazing work. Cheers!
great work
Waiting for graphs playlist
Bhaiya please DP series complete kardo
can u please complete this set of dynamic problem LIS and other topics are still pending atleast give us the question set please
hey bro, you complete the playlist lis,kadane,grids and others question are left
yes we remember nutanix xD
great 😂😂
@@TheAdityaVerma bro, we know you will have your reasons for not completing the playlist... But can you please complete it as soon as possible. Anticipating for the complete playlist as much as we anticipated for Bahubali2!!!
@@janakirambasava1535 more than bahubali 2
*** lil correction (here Bottom Up ---> Top Down) and vice versa , otherwise good explanation .
@Aditya Verma - can you please post videos DP for grid?
Nicely ecplained
Diljale Wale approach Use karto bhai, Gajab 😂
sir please make a video on OPTIMAL BINARY SEARCH TREE
Can anyone explain how we can solve burst balloon problem(leetcode dp hard) using mcm?
understood
Bhaiya LIS ki videos b upload kardo
great
MCM started ✌
better than gfg dsa!
thanks
how do you do mcm on rod cutting problem in interviewbit
next should be on linked list or graph please
How we are concluding that when i>j there are no elements in the array
Since i has been taken to be the left index and j to be the right index, hence, its obvious that i should always be j, it means the left pointer has crossed the right pointer which is impossible according to what we have taken. Again, this would differ wrt question which he mentioned, but for this case, it stands invalid for i>j. Its quite similar to what we do in binary search. As soon as the left pointer crosses the right pointer, we break the while loop. Same is happening here.
chiill krdiya bro ye problm😗
You actually should right book
Any good explanation for min and max value of an expression having * and + ? couldn't find in this channel.
bhaiaya agar aapne saare topics cover kr diye toh , baaki youtubers toh gaye ,, please bhaiya kar do
how to clear OA....yaha OA round hi clear nahi ho raha intern kaha se milegi....
sir,Can you please make playlist on graphs
OP!
Tier-3 ke liye aap masiha ho , Thanks a lot
Tier-1 Tier-2 ke liye bhi
@@pk4288
Nice
Bahut bura haal hai fir toh 🤣
@@shubhamagarwal2998 hn Bhai :(
@@pk4288 😆
Are prabhu kaha the app abhi tak
Bhaiyya Longest Increasing Subsequence ki playlist ??
whao.... thanksss
bhai greedy aur graph ka playlist bana do
boss is painters partition is also of this type?