10 am rn 3rd day of watching your series and Now I'm able to write code myself of some questions without you completely explaining it Just Superb!!
@ketankhandelwal8626
3 жыл бұрын
Same here.
@pranav288
2 жыл бұрын
what's the point of mentioning time
@AbhishekYadav-rm4hw
Жыл бұрын
@@pranav288 He covered these many videos in 2 days, I think this was the point probably .. but who cares
@shobhaseth2111
4 жыл бұрын
Its like you are teaching knapsack all over again! :D
@abhisheksoni7405
2 жыл бұрын
At 22:07, minute change is needed, in below condition .....j should be J-1, as below. t[i][j] = max(t[i-1] [j] , t[i] [j-1]); Thanks aditya for superb explanation :)
@bite091_jamee7
2 жыл бұрын
well u r right but he wrote it many times in video so we should get it by ourselves
@sufiyaniqbal5280
2 жыл бұрын
@@bite091_jamee7 no he wrote so what Abhishek Soni has done write by mentioning this ...thanx aditya
@bite091_jamee7
2 жыл бұрын
@@sufiyaniqbal5280 as u say
@sufiyaniqbal5280
2 жыл бұрын
@@bite091_jamee7 bro do u do coding becz i need a coding partner if ur free we can practice together
@aayush1204
3 жыл бұрын
I was able to write the correct bottom up version of LCS without even completing the video because I've been watching this playlist from the beginning. All thanks to you Aditya 😀😀
@devkapadia4796
3 жыл бұрын
yes i also agree.
@rachanaraut5718
4 жыл бұрын
So happy to say that after going through 20 videos, I could code this question even before the 4th minute was hit of this video while simultaneously listening to this video. Thank you Aditya!
@parvahuja7618
5 ай бұрын
us
@VishalKumar-xr4nm
2 жыл бұрын
You are great teacher. I was very weak at DP but now after watching your videos, I am able to do most of the problems of DP. 😊
@shubhambansal2161
3 жыл бұрын
Bro You are the champ. I haven't seen somebody to explain DP like this. You are doing the great work for the community. Thank you so much. Also, please don't stop making videos, make more content on DSA as everyone should need this kind of explanation.
@vaibhavm1007
4 жыл бұрын
Amazing videos seriously! I was able to do the memoized and bottomup code for this by myself because your explanation of the concepts was so good for knapsack itself! :D
@nityanandbhaskar2155
4 жыл бұрын
Thank you very much for this youtube course. I have been rejected at coding interview just because i didn't know how to approach dynamic programming problems. But after practicing it for few months now , I feel confident enough to crack these interviews.
@arkpandey7679
4 жыл бұрын
Thanks bhaiya, I was really scared of DP, after watching your series in continuation, I am able to write code and solve DP problems easily.
@shahkrimabrijesh4650
3 жыл бұрын
This series is awesome based on recursion and memozied version i was able to get the top down without looking at the video in one shot even though i m a newbie to dp. salute.
@HarshSharma-je8rk
4 жыл бұрын
Else condition should be t[ i ][ j ] = max ( t[ i - 1 ][ j ], t[ i ][ j - 1 ] ) ; U forgot "-1" in second argument of max function.
@TheAdityaVerma
4 жыл бұрын
Yeah, my bad !! Typo !! 😕
@bijitashyabirinchi1721
4 жыл бұрын
@@TheAdityaVerma As the size of the matrix is t[m+1][n+1], shouldn't we return t[m+1][n+1] instead of t[m][n] at last?
@yadavaditya2932
4 жыл бұрын
@@bijitashyabirinchi1721 when we initialize t[m+1][n+1] the array has index from 0 till m and not till m+1 same case with n. Thus we return t[m][n] and not t[m+1][n+1].
@ujjwaljain9780
4 жыл бұрын
Search for this comment 😅😅...
@koreancaptain2955
4 жыл бұрын
@@bijitashyabirinchi1721 you first go and learn 2-D array then come to this
@bhaskyOld
3 жыл бұрын
Great explanation as usual. Just one information. In the DP array towards the "i" dimension we are only referring to at-most 2 rows at a time [i] and [i-1]. So we can create dp array like dp[2][len2+1]; Then we can use modulo operator to reuse this two rows. Memory optimization only O(min(len1,len2))
@priyarathore9266
3 жыл бұрын
Best DP course on internet!
@suchetanchanda871
2 жыл бұрын
After I have seen your KnapSack videos , I didn't even need to see these videos. After understanding the choice diagram , I could do the memoization and tabulation on my own! Thanks to you sir!
@ytann
4 жыл бұрын
You know you're a good teacher, when I know how to do this, before starting the video.
@shashwatmahodaya9695
4 жыл бұрын
after some months you will have way more viewers than any youTube channel on DP !! thanks bruh!!
@Shubh_here
Жыл бұрын
Wow sir you are great teacher i had written my code by myself without watching this video thank you so much bhaiya
@LearningYouth
2 жыл бұрын
I solved it without watching the whole video...I could solve it because I understood really good in Knapsack time. Thank you Adtiya bhai.
@blasttrash
4 жыл бұрын
bro this is bottom up as you also mentioned in a pinned comment in 1st video. Just change the title and description whenever you are free. Video and audio cannot be changed, but title and description can be changed and will avoid confusion for beginners who might come to see your video 1 or 2 years from now once your channel becomes quite big(like abdul bari's channel became big in last couple of years).
@DheerajDivaker
Жыл бұрын
true:)
@vivekupadhyay737
2 жыл бұрын
you're explaination of problems are so intuitive that I was able to write code, before you started writing it.
@kartiksaini5619
2 жыл бұрын
bhaisaaab maja aagya bro ur the best,meri recursion sai bahaut fatjati thi but after watching ur recursion playlist +dp vali matlab ab best muje recursion hi lagg raha hai and dp thx alot bro may god bless u and ur family ....aap jesa teacher ho toh banda kahan sai kahan chala jae...
@ChandraShekhar-by3cd
4 жыл бұрын
@Aditya Verma Thanks a lot for such a deep insight over these important topics. Please upload more videos on tree and Graphs as well. Thanks
@janvisingla3746
4 жыл бұрын
Sir ,You are just osm ,i wrote Bottom-up(Your Top-Down) Approach without even watching your this video. thanks a lot;)
@lifeexplorer2965
4 жыл бұрын
Never seen this kind of approach of converting Memoization to Top down ... awesome !
@TheAdityaVerma
4 жыл бұрын
Thanks !! Will be uploading more videos in may till then keep sharing to help this channel grow + thats motivates me to make more videos !! ❤️✌️
@AnkitKumar-ft5yu
4 жыл бұрын
@@TheAdityaVerma sir may is here please upload videos. I am preparing for interview and eagerly waiting for your awesome videos
@xsuritox1058
4 жыл бұрын
@@TheAdityaVerma Sir ji august chal rha hai aur videos please daal dijiye, interviews hai samne
@nikhilbhadragiri6134
4 жыл бұрын
@@TheAdityaVerma bro I had a special problem on LCS will you solve it
@nikhilnagrale
3 жыл бұрын
You should say Memoization to Bottom Up
@ApiiiitaaaaPakoooodaaaaaa
27 күн бұрын
best playlist on youtube for dp
@4n3-niteshkumar16
2 жыл бұрын
Dil ko sakun mil jata hai ase video dekhne ke bad 3 video dekha mera all doubt clear ho gaya
@atharvakalele37
2 жыл бұрын
Greatest explanation of Dynamic Programming!
@payelbandyopadhyay2866
4 жыл бұрын
Guruji backtracking mein video banaiye plz. Plz, meri request accommodate karein.
@ViralAgrawal12321
4 жыл бұрын
please sir backtracking
@sayantanbanerjee821
3 жыл бұрын
+1
@rituraj6056
3 жыл бұрын
@@sayantanbanerjee821 +1
@biswajitsahoo1456
3 жыл бұрын
+1
@karanveersingh5535
3 жыл бұрын
Kisi ko mili backtracking ki ultimate playlist jaha se crystal clear ho jae jaise Aditya sir padhate hai
@crunchworking3601
Жыл бұрын
Able to solve before watching the video. Thanks a lot Sir
@abhisheksagar604
4 жыл бұрын
Solving the problem within 10min but still watch full video dont know why.Thanks buddy its very helpful for us
@qR7pK9sJ2t
4 жыл бұрын
I never ever thought that I would say this but after @mycodeschool..@AdityaVerma is the next god for CSE students..
@biswajitsahoo1456
3 жыл бұрын
sad
@vinayhegde
3 жыл бұрын
Every time I tried learning DP from any source, used to get confused, and ended up skipping it. With your videos cant stop watching them.. It all makes sense now !! Great going Keep it up!
@nknidhi321
2 жыл бұрын
Hands Down !! Thank You.🙌
@sahil1053
Жыл бұрын
are bhai shab ye kya kr diya aapne . bina video dekhe hi m question solve kr k aa gya .. itne acche se kon smjhata h
@rajeshrajan4464
3 жыл бұрын
Best teacher for coding problems. Been following your series and has been eye-opening to say the least!! Awesome work Aditya. Thank you.
@kunalbahirat7795
2 жыл бұрын
You have explained the concept in a very superb way!! Thanks :)
@debugagrawal
2 жыл бұрын
Shat Shat pranam guruji ♥🚀✨ Able to solve without watching videos asn, watched all previous videos so fundas got strong , thanks 🙏
@prathamjha7010
3 жыл бұрын
Never thought I will learn dp this smooth
@sanchitkaul5084
4 жыл бұрын
Bhai Jeet Gaya Tum!!! OP level teaching!
@vakhariyajay315
Жыл бұрын
Thank you very much.
@zehn1022
4 жыл бұрын
Can you solve CONTAINS DUPLICATE I, II, III questions of Leetcode?
@devanshmesson2777
3 жыл бұрын
I want to thank you so so so so so so so so much man! Amazing videos for beginners!!
@trippinojas
4 жыл бұрын
Sir ye to bottom up approach hai kyuki isme apan 0 se upar values daal rahe hain aur pehle wala top down hai na kyuki usme apan n se call karke wo value save kar rahe hain. And Sir your content is very good. Keep it up, Thank you.
@viralonce2671
Жыл бұрын
usually i dont comment but after watching this playlist ,cant stop commenting
@parteeks9012
3 жыл бұрын
This series is recursion without memoization repeating the same thing again and again ..... :) btw nice i came here to learn dp and now expert in recursion and dp.
@foodie_gamer
2 жыл бұрын
bhaiya i first made the code from by myself then watched it.... thanks to your recursive approach i could make this code by myself..... btw you forgot a -1 at last. thank you bhaiya
@umanggupta9950
4 жыл бұрын
Mast Bhai, love from MNNIT
@aishiksarkar8226
3 жыл бұрын
If DP is an art you are an artist sir
@mdhabibullahansari3651
3 жыл бұрын
maza aa gya bhai video se bohot kch sikhne ko mila,
@aayush5474
4 жыл бұрын
happiness is being able to solve the question without even watching the video but i still watch it xD
@SreekantShenoy
4 жыл бұрын
same :)
@aishiksarkar8226
3 жыл бұрын
Same :)
@shubhammahindru3563
Жыл бұрын
Some videos are awesome, and other are fantaboulus great to see the videos of LCS after knapsack makes it cherry on the cake, thanks dude thanks a lot
@spartan1998
3 жыл бұрын
What a guy !! Just love your videos ...plz make some videos on other topics too
@Vishal-ds6ly
Жыл бұрын
thankyou so much sr please make playlist of graph and tree.
@rv0_0
4 жыл бұрын
You should make your channel cover as "Mera Bottom-Up hi mera Top-Down Hai " ..........mast lagega
@jolly_dollyyy
3 жыл бұрын
😂😂😂
@Skkskk702
3 жыл бұрын
boht badiya padhaya maze aagaye
@ss-ny2oh
3 жыл бұрын
BEST DP series!!!
@abhimanyuraizada7713
2 жыл бұрын
Do we have to do bottom up approach in interview mandatorily or just memoisation will work fine?
@amitkarn1888
8 ай бұрын
@TheAdityaVerma Solving the smallest problem first and then building the solution for the main problem should be bottom up.. right? or am i wrong? why is this called top down?
@nainabakolia2044
4 жыл бұрын
Please make videos on backtracking and graph too, please :( .
@xdxtx
4 жыл бұрын
Dude!!! DP simple AF
@TheAdityaVerma
4 жыл бұрын
haha Thanks ! 😅✌️
@himanshumalik6913
2 жыл бұрын
Solve Memoise & Bottom-UP by myself, thanks you sir.
@kirtxn_
6 ай бұрын
bhai aditya bhaiya op saxx bhai saaxxxx just loved ur way of teaching brooo 💓💓
@heenaagarwal6795
4 жыл бұрын
Please make video on backtracking. I will definitely watch ALL your videos till now.
@AmanKumar-fd5ec
4 жыл бұрын
the recursive+memoisation code on Leetcode is giving TLE as well
@amanrai8010
4 жыл бұрын
yeah, time constraints of dp questions are very strict in leetcode. Even I solve array questions time limit was not that strict you can easily pass brute force solutions there.
@jatinthakwani5370
4 жыл бұрын
my memoisation code got accepted on leetocode. class Solution { public int longestCommonSubsequence(String text1, String text2) { int m=text1.length(); int n=text2.length(); int[][] t=new int[m+1][n+1]; return lcs(text1.toCharArray(),text2.toCharArray(),m,n,t); } int lcs( char[] X, char[] Y, int m, int n,int[][] t) { if(t[m][n]!=0) return t[m][n]; if (m == 0 || n == 0) return 0; if (X[m-1] == Y[n-1]) return t[m][n]=1 + lcs(X, Y, m-1, n-1,t); else return t[m][n]=Math.max(lcs(X, Y, m, n-1,t), lcs(X, Y, m-1, n,t)); } }
@harshitgarg9444
3 жыл бұрын
Try passing your string by reference. Due to recursive calls by value, it takes some time to create the same string at all function calls. In tabulation there are no recursive calls, therefore it passes.
@amishasahu1586
2 жыл бұрын
Hey sir, your teaching skill is amazing. Thank you for the efforts you are putting in. Sir, I have one doubt, like you said iteration method is a Top-down approach and Memoization is a Bottom-up approach. But in various other sources including gfg says vice-versa. Please clarify my doubt.
@original_gangsta_
2 жыл бұрын
Yes, the other sources are right. The memoization is called top-down and tabulation is called bottom up.
@ranjeet5806
2 жыл бұрын
you are in the 20th video of this playlist and still have this doubt in your mind?
@DheerajDivaker
Жыл бұрын
yes @Amisha Sahu, your doubt was valid. Explanation of this video is actually a bottom-up. Iterative - Bottom Up Memoization (Recursive) - Top Down
@AnkitChaudhary2601
3 жыл бұрын
Don't you think you are calling top down approach as bottom up and bottom up as top down. In top down approach we start with large input let's say n, and then we reduce it to smaller let's say n-1. In general top down means starting from large input and in each next iteration/recursive call, reduce it, means going from top/large to down/small input
@gopalchaudhary6170
2 жыл бұрын
Thank you so much sir🙏❤️
@vijaypalmanit
3 жыл бұрын
I like when he says: " Bas ho gaya bhai, aur kuchh nahi hai isme"
@raviashwin1157
4 жыл бұрын
halwa bana diya question ko itna asan kaise kar diya bhai,good job bro
@vishavjeetsinghthakur
2 жыл бұрын
Thank you for this series. Graph ki bhi bnalo
@harshagarwal7552
4 жыл бұрын
Do u have your complete course at any other platform ..?
@TheAdityaVerma
4 жыл бұрын
No brother, I haven't even monetized these videos yet tbh 😅😅, why would I have a paid course somewhere else. Will be uploading more here, Dont you worry ✌️❤️
@ritikshrivastava9442
2 жыл бұрын
just curious to know how many white pages you had used while creating this playlist
@VISHALKUMAR-bo9mo
4 жыл бұрын
Please, make a video on finding LCS in O(nlog(n)) time complexity.
@rishesmishra1740
3 жыл бұрын
22:00 Wasn't m and n was correctly written , why did u changed it to i and j? Because you said that at first we are matching the last characters of both the strings but that won't happen if we compare x[i-1]and y[j-1], as initially i and j both are 1 in the for loop? So it becomes x[0] and y[0] and that means that you are comparing the first characters, so there is a contradiction, no?
@sagarahir2740
3 жыл бұрын
Right
@sagarahir2740
3 жыл бұрын
@aditya varma see this
@gvsai543
11 ай бұрын
Hi i got this doubt, let us say x[i] == y[j] now the answer would be 1+ T(i+1,j+1). Now the doubt is that what if this subproblem t(i+1, j+1) finds an lcs that is not immediate to i and j.
@anjalikumari2796
4 жыл бұрын
Explanation is awesome..
@gamersgame43
6 ай бұрын
This is bottom-up approach or also called as tabulation as we start solving from base cases (smaller subproblems) and go towards solving large problem
@thedarthlord7724
2 ай бұрын
galti se mistake
@gouravkumar834
4 жыл бұрын
I think else condition should be like T[I] [j] = max( t [i-1] [j], t [I] [j-1] )
@shivangishukla2629
4 жыл бұрын
yea, it's a typo.
@ShivamSingh-vh1xz
4 жыл бұрын
Yes I also observe it and made it correct myself .😊😊
@abhinavkumar6584
2 жыл бұрын
paused at 0:27....opened leetcode...solved it in 5minutes...dude do something about graph and trees...I will buy u something with my first salary as a token of appreciation :)
@shivanshsrivastava4099
8 ай бұрын
this soln at gfg is mentioned as bottom up pls clarify... ig it's how you iterate , i.e., if you go from 0 to m then it's bottom up and the reverse is top down
@ritikgupta8478
4 жыл бұрын
Looking forward for more videos :)
@kingshukpal301
8 ай бұрын
this question is is also one of the question which gives tle on solving it using memoization and not tabulation
@ketankhandelwal8626
3 жыл бұрын
Sir u have told us to start searching from back of the string but you are using X[i-1]==Y[j-1]. which implies we are start checking from forward.
@Udzial
2 жыл бұрын
Good point!! In the earlier 2 videos it was from back thats why it was top down. and now this one is bottom up so we start from the initial and build up solution for the final problem .
@BRSanush
2 жыл бұрын
Plz give dronacharya award to this guy.
@AlbertoRodriguez-oe6jo
2 жыл бұрын
As Japanese say on leetcode: Take my knees. Youu're guru of DSA.
@javi2082
4 жыл бұрын
Is the tabulation method called Bottom Up ? Or the other one recursive+memoization. In some sites, I saw that Tabulation method was written as Bottum Up. Please clear this up!!??
@gauravsohaliya5871
4 жыл бұрын
recursive+memoization is top-down and tabulation is bottom up.
@rashimishra3140
4 жыл бұрын
Which one is more time efficient among tabular approach and memoization ?
@pulkitkaushik4539
4 жыл бұрын
tabular bcoz no stack is used there
@harsh9558
2 жыл бұрын
Thx a lot man!
@subashraj3919
4 жыл бұрын
Good Explanation
@rameshgaming1020
2 жыл бұрын
Am I mistaken or is this video naming it wrong? Isn't top down approach also called memoization? And bottom up as tabulation?
@aashukumar1348
4 жыл бұрын
Bhaiya array, string nd matrix k famous ques ka v series bna do..kaafi din v ho gye aapne video nhi upload ki😀..plz ❤️❤️
@ritikgupta8478
4 жыл бұрын
Amazing Explanation.!!
@sudhanwapande2040
3 жыл бұрын
please explain to me what is the need for initialization in the bottom-up approach?
@vishnusaitejanagabandi9009
9 ай бұрын
Thankyou sir !
@satanshuag
2 жыл бұрын
ThankYou!!!!
@iamparitosh
3 жыл бұрын
Actually, it is not just stack overflow, top-down is actually faster than memorization. The time complexity just talks about the number of operations but the computational costs are a lot different
@MilindGupta
3 жыл бұрын
Hey can you clear me in short I am able to write this dp code... But still I am not clear with the thing that was top down and bottom up dp
@__okays__
3 жыл бұрын
@@MilindGupta recursion is top-down(we first solve bigger problems then smaller ones) while dp is bottom-up(we first solve smaller sub problems then bigger ones).
@MilindGupta
3 жыл бұрын
@@__okays__ so this was bottom up right then since we are finding smaller length and then proceeding further
Пікірлер: 309