This playlist is one of the rarest gem in youtube.
@Prashantkumar-pn6qq4 жыл бұрын
gem which is yet to be found by many coders!
@kollivenkatamadhukar50593 жыл бұрын
leetcode.com/problems/maximize-palindrome-length-from-subsequences/ using this idea doesn't work always, this question is a example.(I mean it makes things harder)
@pr14933 жыл бұрын
@@Prashantkumar-pn6qq tere jaise bache coders ke liye ye playlist chahiye
@thegreekgoat982 жыл бұрын
@@pr1493 kyu bro... Tereko kya lagta hai yeh DP playlist acha nahi h?
@pr14932 жыл бұрын
@@thegreekgoat98 Ye use kar le, but aisa nahi h ki bas yahi aisa playlist h jo useful h.. lol.. dekh ke kuch ni hone wala h unless you practice
@tejasjoshi19073 жыл бұрын
I am literally watching it like a webseries were I am always curious about what will happen in next episode and it is always hilarious 🔥❤️
@_ChetanaNagare2 жыл бұрын
exactly 😂💯
@FardeenKhan-pn2hk2 жыл бұрын
basically a suspense thriller😅
@maniyadav32562 жыл бұрын
Exactly, Whenever I start a new video a suspense is there that what new technique he is going to apply . literally Loved it......!!!
@rachakondaeshwar4129 Жыл бұрын
exactly
@kusumkoli665 Жыл бұрын
same!! i concept i was afraid of is so interesting now
@sarvagyaiitmadras87273 жыл бұрын
Teaching alone in room :- "Ye question sab questions ka BAAP hai" Mom enters the room :- " Ye questions sab questions ka Parent question hai " 😂😂
@TheAdityaVerma3 жыл бұрын
😂😂😂😂😂😂😂😂😂
@मयंकपठानियाँ3 жыл бұрын
@@TheAdityaVerma bhai sach btao aa to nahi gyi thi mammi kyun laga to sun k esa hi.
@shashwatrai19893 жыл бұрын
@@TheAdityaVerma bhaiyya please put a video even though you don't teach anything. missing you kinda haha
@DSA_Coding3 жыл бұрын
hn bhai
@divyagarg32833 жыл бұрын
@@TheAdityaVerma How can we count all palindroming subsequence of a string Using this approach ??
@happynewyear61234 жыл бұрын
i never imagined i would feel confident in dp just by watching 25 videos !
@naiksachin65243 жыл бұрын
this is the 26th video
@rishabsharma53073 жыл бұрын
@@naiksachin6524 It's 25th only, for programmers counting starts from 0
@mohdhasnain38123 жыл бұрын
@@rishabsharma5307 GOod one
@ccarnagee78674 жыл бұрын
When you said that the second string is redundant, I realised that here the second string would be reverse....And LCS again...Thanks for making things such easy for us....
@TheAdityaVerma4 жыл бұрын
Thanks for watching brother !! You really have a sharp mind, not my credit 😅
@Rk-tm8z2 жыл бұрын
same here
@anonymousanonymous7507 Жыл бұрын
I guessed it even before
@sayanghosh28833 жыл бұрын
Due to your great teaching skills i figured out that we have to reverse on my own. Thanks for this great course on dp.
@prajwalagarwal84252 жыл бұрын
seriously dude, me too
@anm0lsrivastavasings2 жыл бұрын
+1
@codercube3751 Жыл бұрын
+1
@harshita6683 Жыл бұрын
@@prajwalagarwal8425 me too
@prachij4 жыл бұрын
I have never been so excited to study dp before. 😁 I am excited to watch every next video and understand concepts which I once thought equivalent to rocket science, and now it's so much fun 🔥 All credits to you legend ❤️
@TheAdityaVerma4 жыл бұрын
Thanks Prachi 😅✌️
@shlokbansal54522 жыл бұрын
@@TheAdityaVerma you are legend. can you also please upload other remaining topics like kadane's and Fibonacci questions
@mayukhchatterjee59982 жыл бұрын
@@shlokbansal5452 achha just tell me, will this be done without actually reversing the array and, by making j= last element, and check a[i] == a[j].... and hence
@SaiTeja-ob6zg2 жыл бұрын
@@mayukhchatterjee5998 yeah we can int longestPalinSubseq(string a) { //code here int n=a.length(); vectordp(n+1,vector(n+1,-1)); for(int i=0;i
@suvamchatterjee2177 Жыл бұрын
@@shlokbansal5452 watch striver for rest topics and match it with his pattern.Thanks
@anishapandey40373 жыл бұрын
I listened to problem statement and voila, I had the solution in my mind within 30 seconds. All because of this playlist. Thank you so much!
@nikhilpandey8564 жыл бұрын
It looks like for the first time i am binge watching a course series....
@0anant04 жыл бұрын
26 of 50 (52%) done! Very good expl of logic!
@dhyani-jii2 жыл бұрын
Your 2 years ago comment motivting me now.
@abhashkumar8090 Жыл бұрын
@@dhyani-jii your 1 year ago comment is motivating me now.this shows how great teacher he is,every year someone new comes and learns from this goldmine.
@maneshwarsingh86883 жыл бұрын
I see a lot of comments on this video on how to solve 'Longest Palindromic substring'. The method of LCSS(s, rev(s)) will not work in this case (can be easily shown by few counter-examples). However the question in itself is very easy to solve and requires nothing more than memoizing the recursive solution. We simple pre-compute and store whether s[i...j] is a substring or not in a DP[n][n] table. Code: bool isPalindrome(string &s, int i, int j, vector &dp){ if(i>=j) return true; if(dp[i][j]) return dp[i][j]; if(s[i]!=s[j]) return dp[i][j]=false; return dp[i][j]= isPalindrome(s, i+1, j-1, dp); } string longestPalindrome(string s){ string res=""; vector dp(s.size(), vector(s.size())); for(int i=0; i
@saurav0203srivastav2 жыл бұрын
Well it will work, heres how class Solution { public int longestPalindromeSubseq(String s) { if(s == null || s.isEmpty()) return 0; int n = s.length(); String rev = new StringBuilder(s).reverse().toString(); int[][] dp = new int[n + 1][n + 1]; for(int i = n - 1; i >= 0; i--){ for(int j = n - 1; j >= 0; j--){ if(s.charAt(i) == rev.charAt(j)){ dp[i][j] = 1 + dp[i + 1][j + 1]; }else{ dp[i][j] = Math.max(dp[i + 1][j], dp[i][j + 1]); } } } return dp[0][0]; } }
@aravindram8714 жыл бұрын
Your casual approach to solving problems is simply awesome. As I am watching your videos, I think that is the key skill to learn. Dumb down the problem statement and think through the patterns. Great job !!. Please keep it coming.
@monikachaudhary96394 жыл бұрын
Very nice and unique explanation, can't imagine it was that easy. I could never understand the table every one start filling for this problem. You made it super easy. Thank you.
@RohitKumar-fy9fp Жыл бұрын
ya monika
@aryanmaheshwari1006 Жыл бұрын
Before you tell me the approach to reversing a string, my mind already came up with the idea of reversing the string and applying LCS to achieve the result. You are truly next level 🔥. Thank you so much ❣
@23cash86 Жыл бұрын
Spoiler alert daal deta vro ,XD
@AyushGupta-mh6vq Жыл бұрын
@@23cash86 lol😂
@priyanjalinath Жыл бұрын
true 🤣@@23cash86
@prathameshkhadse34813 жыл бұрын
This exact question was asked in coding round and I explained it just like this, I could say the interviewer was impressed by this approach. Thanks Aditya Verma for making these videos 🙏🙏🙏
@aakashtiwari95053 жыл бұрын
Bhai kaunsi company k wo nhi btaya aapne
@sachintalakeri31753 жыл бұрын
One of the best playlist I have ever come across in KZbin. This will really help new graduates and professionals
@himanshubhumbla55134 ай бұрын
49 sec in and i have a logic in my mind of comparing the string with its reverse and finding lcs. You're a great logic builder
@galaxyyy6642 жыл бұрын
I literally cannot believe I came up with the solution before even watching the video, have always been so scared of DP but now I'm getting comfortable with it. You my friend are doing god's work, Thank youuu.
@tanujgyan7873 жыл бұрын
Seriously 2 mins in video, maine pause kia and i was able to think of solution myself. kuch to tumne sikha dia hai yar, amazing work!!!
@PriyankaYadav-ks5fe3 жыл бұрын
As I was afraid to solve the problems But you made it easy Now I am solving the problems with confident Thanks sir
@GdLongerHandle4 жыл бұрын
Thanks bhai apne itne sikha dia pichle videos m ki ab main khud s soch sakta ki ap is ques m kya karoge. Dil s Dhanyabad 🤗
@meetfluffer9373 жыл бұрын
Bhaiya, You've taught me what no one else could.... You taught me how to think!! I could solve dp problems on my own :)))))))) You don't know how thankful I am right now!!
@revvedupofficial2 ай бұрын
I thank you, from bottom of my heart, to create this series to help us. No one can do this. Period. Thank You
@TheBoredandCool4 жыл бұрын
You are gem of dp. You made it so easier for all students to understand.
@ananyam81453 ай бұрын
You're simply the GOAT, Aditya, thank you!
@shauryarehan40744 жыл бұрын
one word for you sir, You are literally a gem ! , the way you explain can't be matched , I wrote the recursive sol for LPS just after watching the ip and op format. :)
@AkGautam_19043 жыл бұрын
I came up with the right approach in first sight. Thank you sir 💐💐. You made me confident in dp 🙏🙏.
@LokeshSharma-hm5jz Жыл бұрын
You are really a magician, every video is like a suspence which is revealed in the end . Most of time I was clueless and not a single time i lose the focus.
@shrayanshjakar67072 жыл бұрын
Your teaching skills and logical reasoning is on next level sir
@gauravshukla52034 жыл бұрын
i want to thank you from bottom of my heart ....although i am learning dp for the first time,but after watching one or two videos of this lcs series i am able to solve every question on my own just by looking at the problem statement..these videos are not just videos but blessings for all who are preparing for coding interviews!
@jitendraraghuwanshi86353 жыл бұрын
bro this playlist is one of the best playlist I have ever seen in my life on any subject.
@sourabhsisodia95632 жыл бұрын
College seniors recommended his playlist for DP ,i recommend this to my juniors and the cycle goes on. You and your work will be immortal DP king
@sharinganuser15394 жыл бұрын
longest palindromic subsequence---> reverse ur string longest increasing subsequence---->sort ur string. do lcs.
@jayantsharma52094 жыл бұрын
for longest increasing subsequence, sort will not work as it will give longest non-decreasing subsequence. For LIS, we need to both sort and remove duplicates.
@manishmalhotra58834 жыл бұрын
@@jayantsharma5209 @jayant bro why it wouldnot work .I am not able to come up with a counyer example . Can u help me .
@ssidhu3 жыл бұрын
@@manishmalhotra5883 because in longest increasing subsequence problem the choosen subsequence should be strictly increasing i.e [1, 2, 2, 3] is not an increasing subsequence it is non decreasing subsequence. So by removing duplicates we can make it longest increasing.
@vaibhavagarwal58233 жыл бұрын
How to find longest bitonic sequence in an array with this approach?
@VIVEK18983 жыл бұрын
Thanks man!! I was struggling with the LIS problem.
@paragkhandait62063 жыл бұрын
Bro the way you explain dynamic programming, hats off to you. Never ever saw anyone explaining DP so perfectly. Watching the playlist on a binge mode.
@shashankbajpai56593 жыл бұрын
you are our savior bhai. Sharing this level of content for free is something really great from you.
@Vishal-ds6ly Жыл бұрын
I solved it without seeing your video you teach so well man hats off to you.
@nitishgadangi3 жыл бұрын
One word - MindBlowing Explanation!
@binay_krishn3 жыл бұрын
03:25
@charan7754 жыл бұрын
Thanks for this playlist brother. I was able to figure out the solution very quickly when I thought in the direction of LCS. Thank you
@prakhargupta57203 жыл бұрын
u made me this ... before seeing the video i knew the answer, i cant thank u even. I dont know either u r great or not but the thing is ur conept made me this. definitely i would suggest your videos to everyone.
@waruncool4 жыл бұрын
Thank you! This made my day. Already on the 26th and i started today. Can you put 27 video again?
@harshdeepsingh67684 жыл бұрын
This is surely the best content online for dynamic programming. Really thankful to you bhaiya.
@SujitKumar-sr5cq4 жыл бұрын
I came this channel to watch one video but one by one i watched whole playlist Amazing explanation very helpful videos brother
@anshumangogate48062 жыл бұрын
I first solved this question by watching the explanation of some another channel, I'm simply amazed to see this solution. It is far more logical and easy.
@anmoljain3654 жыл бұрын
I'm watching this to prepare for my placements and it's really helping me. If I got a decent placement I'd like to give you a treat 😂😂.
@shashwatrai19893 жыл бұрын
bro kya hua? Hope you got a dream package.
@anmoljain3653 жыл бұрын
Yes I got placed in a good company. Aditya Ji party kab loge ✌️✌️ Your content really helped me prepare for placement tests and interviews. Thank you ❤️❤️
@anmoljain3653 жыл бұрын
@Anmol Dogra bhai nhi behen SAP labs hua✌️
@shashwatrai19893 жыл бұрын
@@anmoljain365 ehhhhh anmol ladki ka naam? omg my whole life has been a lie
@anandsharma58503 жыл бұрын
@@anmoljain365 congo!!!
@abhijeetkumar475229 күн бұрын
best approach yet ! i was able to do it my self easily ! thanks man i am finally getting dp now
@himanshukhairajani4 жыл бұрын
I can't contain myself to NOT like your videos..... Sir you might not even know but you are doing WONDERS in student's life... College doesn't even provide 10% of what you do in minutes ! A big THANKYOU @Aditya Verma Sir !
@mukulverma84044 жыл бұрын
Best channel on youtube, crystal clear explanations and amazing concepts.
@shubhaverma56976 ай бұрын
my mind is blown. I have never seen such an approach for palindrome sequences. kudos, man.
@VinayakSrivastava1013 жыл бұрын
This is really helpful. Thanks a lot for such an eloquent explanation. After watching this playlist from the beginning, I was able to guess the solution on my own after understanding the problem statement! You're the MVP of Dynamic Programming. Keep up the good work 👍🏼
@ritikkaushik34933 жыл бұрын
kitna awesome teacher hai bhaiy yr tu.... salute to you yr
@rishabhjaiswal14864 жыл бұрын
Your observations are just lit,,never seen someone generalising every problem and connecting to some other problem like you are doing,,Hattssss offffff bro!!!!
@manojkumar-dv8pf11 ай бұрын
I think we cannot solve the longest palindromic substring problem using LCS pattern. example: str: abcdba, it's reverse it 'abdcba` . if we find longest common substring then it will be 'ab' or 'ba' and both are not palindromes.
@gautamgoel20243 жыл бұрын
this playlist is similar to a web series , If you miss any episode then you wont be able to understand the next lecture. love you sir. deep respect for you. par meri ek shikayat hain , ab aap videos kyu nahi banate aap ek aditya verma dsa parent of all courses nikaliye chahe paid pls , aaap se hee padhna chahte hain.
@poojaarora72683 жыл бұрын
Thank you so much Aditya sir , this is a lifesaver playlist for placement students who are afraid of topics like DP ....after this i am able to solve questions like a pro !!
@asadnaqvi97364 жыл бұрын
I never ever watch this kind of explanation its superb bro but please upload further videos like Sorting and so on, please upload 🙏
@TheAdityaVerma4 жыл бұрын
Thanks, Will upload soon. Please share to help this channel grow.
@asadnaqvi97364 жыл бұрын
@@TheAdityaVerma sure and I have been waiting for further videos Thanks
@shivamarora70504 жыл бұрын
Bro... hats off to you seriously.... No one can explain better than you.
@sahilanand303 жыл бұрын
Even striver bhaiya recommended this pure gold :)
@rajatgupta74884 жыл бұрын
1:36 Style hai bhai ka Style!!!!!
@gunishmatta3 жыл бұрын
Your videos have developed my thinking in DP...I was able to guess that we have to reverse the string way before you told...Thanks man...best playlist on DP
@aalaprawat47424 жыл бұрын
kamal h maine bhi answer soch liya tha question statement se pehle ... aditya bhai what a teacher you are
@codetochange82 жыл бұрын
Jabardast explanation.. bcoz of which, I figured out to reverse the string by myself halfway down in the video.
@SarthakKumar2 жыл бұрын
Man!!! I did this question under @2:36 time of explaination. This is just unbelievable bhai!!
@thedataguyfromB4 жыл бұрын
@Aditya Tu toh deo manush hai re baba Thank you so much Aditya sir Apne Bhai jaisa koi hardich nahi
@workandearnwithshubhi90503 жыл бұрын
Pattern Cracked just when the question started.... Sab Aditya Bhaiya ki kripa hai !!!🎉🎉🎉🎉🎉🎉🎉🎉
@harshitasingh9633 жыл бұрын
The logic of this question is simply beautiful!
@shubhampawar4562 жыл бұрын
the main thing i have learned from you is analysing the question and i have did that thanks a lot brother
@AJ-gg1jc4 жыл бұрын
thanks sir now i am able to create dp code by my own..... even after solving a problem i do watch video for satisfaction... 🤩
@ryanryan65674 жыл бұрын
Bhai Kya Mast Pdhaata hain yaar tu. Literally Neend aarhi thi DP ki yeh video dekhni shuru ki Sab Gayab. Maza Aagya Bro. Aur Yeh 4 Dislikes waale Sudhar Jaoo yaar Bhaiya itni mehnat krrhe so Like nhi krna plz dislike to mat kro Waiting for the Next Graph Series :)
@yashmittal90404 жыл бұрын
bro thanks a lot really !!! meine itna acha kisiko nahi dekha ds padhate hue
@akashsaxena95423 жыл бұрын
The way he explains is so good that it's messing the way I think...😲💯
@TheAdityaVerma3 жыл бұрын
I am going to plan an idea in your head without you knowing it. I hope you have watched inception :P
@hrushikeshpatil37723 жыл бұрын
@@TheAdityaVerma please put the 27th video
@VishalYadav-dx5zp4 жыл бұрын
Awesome bro!! I am following you from 1st video and you make dynamic programming so easy for us. Thanks a lot....
@finster1563 жыл бұрын
Me: 1. Watched till 1:30 2. went to gfg 3. solved within 5 min as I got it, that reverse string will give ans.. (lcs code is #memoized in my brain. All thanks to him). 4. thanked Aditya Verma(#DP_KING) for this wonderful DP playlist. 5. watched the video again from 1:30
@adityamaurya92774 жыл бұрын
I could think of solution before starting the video. your explanation is great!!
@tanmaysahare23533 жыл бұрын
Bhai tere vajah se mai roj bht excited rahta hu ki aaj kuch naya sikhne ko milenga . You are god of dp
@rajanjayswal37564 жыл бұрын
Thanks, After watching this video I also able to solve Longest Increasing Subsequence problem.. Hat's off!!
@aviseklahiri38644 жыл бұрын
Any idea how to solve the longest increasing sub-sequence problem?
@faizurrahman26444 жыл бұрын
@@aviseklahiri3864 Let a={3,10,2,1,20} be the given sequence. Now to find LIS follow the below steps 1. Store a in ascending order in a new array b implies b={1,2,3,10,20} 2. Now find LCS(a,b); 3. answer is 3
@thatnaman3 жыл бұрын
"Oh Fuck" 3:25 XD. Absolutely love this series. "Thanks".
@shahkrimabrijesh46504 жыл бұрын
Man its day-4 for me watching it from video-1 and this is like a blessing for we dp learners. And we are so thankful that u kept these for free, somebody else might have kept high prices for these. For dp from which i was so scared, I m excited nowadays.
@suyash4605 Жыл бұрын
You are truly a great teacher, after watching all these videos, I knew how to solve this question just by reading the problem statement. All credits to you legend ❤
@vikasvk91744 жыл бұрын
Thank you bhaiya apki playlist ki waje se ab m solution soch leta hu apke batane se phale Once again dhanwad :)
@mudrasurana4044 жыл бұрын
Your explanations are amazing.Can you please make a series on trees and strings as well.Would be very helpful.
@dinarperseus3332 Жыл бұрын
Bro .. your explanation is one of the best ones.. Need More DP topic.. please make it
@rangapavankumar793 жыл бұрын
I am following this playlist for palindrome I saw various approaches on various sites but this is wonderful
@aanchalsharma52644 жыл бұрын
thanks brother u are gem watched your 25 videos and all are just amazing !!!!
@VishalKumar-xr4nm2 жыл бұрын
I figured out the algorithm just after 20 sec in this video, after watching all your previous videos. THANKS. ✅✅👌👌
@srushtipawar77384 жыл бұрын
Great video series:) Please make video on "Longest Palindromic Substring" as well
@prateekchs3 жыл бұрын
Like Longest Common Subsequence is to Longest Palindromic Subsequence, It is Longest Common Substring to Longest Palindromic Substring
@prateekchs3 жыл бұрын
Sorry, above approach will fail for "abcdba"
@abhinandanb35913 жыл бұрын
@@prateekchs exactly! so whats the soln?
@rajshah91293 жыл бұрын
Yes but why it is not working like lcsequence work for lpsequence Lcsubstring should also work for lpsubstring
@djb1552 ай бұрын
How can i solve lpsubstring
@prabaljainn4 жыл бұрын
Sir aap Bhagwaan Aadmi ho....🔥🔥
@keshavraghav38962 жыл бұрын
Submitted this question before watching the whole video...!!! power of aditya verma's dp playlist.
@javi20824 жыл бұрын
WoooW.........MIND BLOWN You are really a great teacher.
@showthecode52234 жыл бұрын
Really sad to see low views on such great content 😔 Best of luck brother 💪 this is excellent content 👍
@bite091_jamee72 жыл бұрын
Really solving those questions which looked like monsters few days ago.... all thanks to you brother
@saileshshiwakoti2160 Жыл бұрын
very great work Sir ... great respect for you...
@pramitdeepkaur54182 жыл бұрын
Great content!! Please keep making videos like these!
@yashrajsingh81813 жыл бұрын
no words to say. You are god of DP indeed.
@appliedai64524 жыл бұрын
@Aditya Verma Can I use the same technique to solve for Longest Palindromic substring?
@GateCSE2804 жыл бұрын
This question was asked in Codenation Online test. Exact same question!!!
@bhajanbarman61423 жыл бұрын
Bhaiyaa mazaa a gayaa!!!! DP is no more a hard topic. I have gone through your video thoroughly with a speed of 0.75 including ohh f**k @3:25 ...............Graph ka bhi banaa do bhaiyaa
@anjalijha1089 Жыл бұрын
you are genius
@priyarathore92663 жыл бұрын
Best DP course on internet , free but gold!
@siddhahast3 жыл бұрын
I had understood these things but had a very hard time to explain it to my wife and she did not even get my explanations and forgot everything what I had taught. But, you have put the right words specially the flow of thoughts which are the most vital things to realise DP end to end and even teach to others or yourself later.
@yogesh9704 жыл бұрын
But this trick doesn't apply to Longest Palindrome SubString. for IP "aacabdkacaa" If I reverse the given string to form a second string and if I apply the LCSubstring logic it gives length 4 (aaca) which is wrong.
@aditya14-022 жыл бұрын
Ur LCS is incorrect it should be aacakacaa
@mayukhchatterjee59982 жыл бұрын
@@aditya14-02 yes.
@mayukhchatterjee59982 жыл бұрын
@@aditya14-02 achha just tell me, will this be done without actually reversing the array and, by making j= last element, and check a[i] == a[j].... and hence