Hey guys, there are 2 mistakes in this video. I did these mistakes while copy pasting.. 22:43 - line 16 should be dp[n] = recur(n-1) + recur(n-2) Remember to store the same recursion call. If you use fib still you will get the answer but the number of states stored will be little more.. sorry for this copy paste mistake. 40:37 - same mistake. It should be dp[n] = recur(n-1) + recur(n-2) I have corrected the code in github and mentioned the mistake as well.
Yeh dp ki sare standard problems and patterns the❤ Agar iska part 2 chahiye (20 questions more) toh 1K likes krne honge iss video pr.. Ab aap decide kro, aapko video chahiye toh like krna pdega 🎉
Great content. I noticed that in some parts of this video, I get the same voice from the background for the exa: timestamp, which is around 57- 59 minutes.
@shashwat_tiwari_st ji bhaiya mene to jitne bhi mere sath vale java se DSA kar rahe hai sabko apka suggestion diya hai aur unko bhi apka samjhane tarika achha laga . Bas aap ayse he one shot aur daily question late rahiye.
sir reels post kara karo ... jisse apki social reach bade , Daily question of leetcode ki reel daal sakte ho aap .. usse kafi reach aa jaygi apki .... and 1 min concept video reel ....aapka content to kaafi achha hain bas reach nahi h .. wo shyad yahi sab kare se aaygi
Shashwat bhai First Question Fibonacci Number The Dp Is Use Like This public int fib(int n) { int[] dp = new int[n+1]; Arrays.fill(dp,-1); return recursion(dp, n); } int recursion(int[] dp, int n){ if(n
Ha shi bol rhe ho, maine copy paste kiya toh change krna miss hogya, jo maine kra usse bhi answer aaega but unnecessary extra space bharega. Aapka code shi hai ek baar pinned comment bhi dekh lena mera.
public int lengthOfLIS(int[]nums){ if(nums==null||nums.length==0) return 0; int[]dp=new int[nums.length]; dp[0]=nums[0]; int len=0; for(int i=1;idp[len]){ dp[++len]=nums[i]; }else{ int idx=binarySearch(dp,len,nums[i]) dp[idx]=nums[i]; return len+1; } private int binarySearch(int[]dp,int end,int target){ int s=0; while(s
Hey guys, there are 2 mistakes in this video. I did these mistakes while copy pasting..
22:43 - line 16 should be dp[n] = recur(n-1) + recur(n-2)
Remember to store the same recursion call. If you use fib still you will get the answer but the number of states stored will be little more.. sorry for this copy paste mistake.
40:37 - same mistake.
It should be
dp[n] = recur(n-1) + recur(n-2)
I have corrected the code in github and mentioned the mistake as well.
Bro create Greedy Algo based too , we are waiting ,
Yeh dp ki sare standard problems and patterns the❤
Agar iska part 2 chahiye (20 questions more) toh 1K likes krne honge iss video pr.. Ab aap decide kro, aapko video chahiye toh like krna pdega 🎉
Ofcourse Sir ❣💙🙏
Bhaiyaa java development me shuru kr dena
lagta hai agla video nahi daloge like to hue nahi 1k
Sir, pls make part 2
Please please like this video and share it over the internet!!!🤩🤩
12:27 -> Fibonacci Number
33:23 -> Climbing Stairs
47:37 -> Counting Bits
1:02:14 - > Min Cost Climbing Stairs
1:21:31 -> House Robber
1:49:14 -> House Robber Il
2:22:32 -> Perfect Sum Problem
2:54:57 -> 0/1 Knapsack
3:47:46 ->Coin Change
3:52:17 -> Rod Cutting
4:09:02 -> Longest Common Subsequence
4:32:02 -> Longest Palindromic Subsequence
4:38:12 -> Shortest Common Supersequence
4:49:57 -> Longest Increasing Subsequence
5:24:18 -> Maximum Length of pair Chain
5:31:03 -> Dp on gride/Matrix
5:49:19 -> Unique Paths
Thanx it helps a lot to look for specific questions 😄😄😄😄🫂🫂🫂
bhaiya your content is just amazing best instructor
Freaking Legend...need to complete it before new year tho..
thanks man!!!!
😄🎈❤️
Clear and easy explanation. Verry verry verry helpful. Thank you!!!!!!!!!!!!!
🙌 Thanks for the love! ❤️
I can guarantee that this will be most helpful legit video even before watching the video..😊 Thank you so much bhaiyya ❤
Thankyou tejas❤ Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Great content. I noticed that in some parts of this video, I get the same voice from the background for the exa: timestamp, which is around 57- 59 minutes.
sorry for that, we will take care of it next time.
Thank you Bhaiyyaaaa..for htis epic dp one shot video.I was got stuck on since november 24.now I understood all the dp topics very deeply..!!!!😌🤗
♥️♥️
Thanks a lot bhaiya!
And Merry Christmas!!!
Thanks! Merry Christmas to you too! 🎉🎄
thanku so much sir great video.
Thanks!❤❤❤
Thankyou so much ❤
Great Explanation! Do not get demotivated by less likes, views or subscribers . Upload part2 as well , you will get more reach . And thank you :)
Much needed video 🙏🙏🙏
Thank your so much❤
Mannnnn what a timing, I was looking for a playlist focusing on DP from scratch, Thanks a lot Tiwari bhai
❤ 🙏 bhai aap share kro aur logo ke sath agar psnd aaye ho toh
@@shashwat_tiwari_st Shared in my groups bro
sir its request to upload the 2nd part as soon as you can...kudos to your efforts sir..❤💛🧡
Amazing content, Thank you so much❤ Will share with everyone i know who is interested in coding
Awesome, thank you!
Thanks for all the videos, really helpful! :)
Glad you're finding them helpful!
Was waiting for so long. Merry Christmas sir🎉❤
Merry Christmas 🎅 🎄
Thank you so much for this video. Really helpful
Sir Ji Thank You 🫡💕💕💕💕💕💕 Best Content Bhaiya
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Sir..... You are the best🤩🤩🤩🤩🤩🤩🤩
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Good Playlist
Litreally Good content , i saw Kunal Khushwaha type content is this , like i am not saying it in bad way but both are best now ,
Thankyou for kind words 😇😊
Amazing 🎉🎉
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Abi exam hai baad Mai dekhu ga thanks
Bhai ayse he one shot late raho hamara support bana hay aapko. bahut acha dp padhaya hay aapne pure consept clear ho gye , thank you bhaiya
❤❤ thankyou brother, aap share kre aur logo ke sath please, hmare bhaut help ho jaege
@shashwat_tiwari_st ji bhaiya mene to jitne bhi mere sath vale java se DSA kar rahe hai sabko apka suggestion diya hai aur unko bhi apka samjhane tarika achha laga . Bas aap ayse he one shot aur daily question late rahiye.
Sir isme apne matrix chain multiplication wale pattern nahi karavae but thanks for this this is really helpful ❤️
Thank you sir ji❤
@@mohit.j5554 Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Love you shashwat sir ❤
❤️❤️
LIS mai to next level maza aa gya
🫡🫡shukriya
Hatts of your hard work and commitment to deliver this level of content free ❤❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉🎉
thank you
bhaiya greedy algorithm ke liye bhi video banao pure u tube pe java me greedy algorithm pe videos hi nhi h
I am sure this is one of the best dp video ❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Thank you brother for this helpful vedio....
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
@shashwat_tiwari_st ji bhaiya
sir reels post kara karo ... jisse apki social reach bade , Daily question of leetcode ki reel daal sakte ho aap .. usse kafi reach aa jaygi apki .... and 1 min concept video reel ....aapka content to kaafi achha hain bas reach nahi h .. wo shyad yahi sab kare se aaygi
Tysm 👍🙏 sir
🔥
Osm sir ❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Much needed Thank you!!!
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
sir you did mistake in Memoization Approach in question 1st and 2nd that is why you got TLE 41:35
Error was you did not change the method name
Are..haa line 29 me recur hoga. 😓😓, thanks mai github pr change kr deta hu.. thanks for pointing
Just WOW ❤❤❤❤❤❤🎉🎉🎉🎉🎉🎉 THANKS BHAIYA ❤️
Dhanyawad, please aap aur logo ke sath bhi share kare, hmare bhaut help ho jaege❤❤
Thanks.
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Shashwat bhai First Question Fibonacci Number The Dp Is Use Like This
public int fib(int n) {
int[] dp = new int[n+1];
Arrays.fill(dp,-1);
return recursion(dp, n);
}
int recursion(int[] dp, int n){
if(n
Ha shi bol rhe ho, maine copy paste kiya toh change krna miss hogya, jo maine kra usse bhi answer aaega but unnecessary extra space bharega. Aapka code shi hai ek baar pinned comment bhi dekh lena mera.
Thank u so much, but i was expecting it as dp playlist.
Thankyou ❤, please see the pinned comment, hope it helps!
Thank you for this video . I am looking for this type video in youtube and you just post it.
❤️❤️ thankyou, agar aapko video psnd aaye ho toh please aur logo ke sath share kare, hmare bhaut hi jada help ho jaege🎉
bhaiya thanks
Thank you sir, I was looking for one hardly from few days
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
@shashwat_tiwari_st zaroor sir
thanku sir ji
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
@shashwat_tiwari_st sure sir
Can all video will marge this type an go in one shot... Like this topic tree, graph, stack,queue...etc ...go on one shot
Thanks ❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Thanks Bhaiya❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Unfortunately, we can give only one thumbs even on such good videos.
You can share on social platforms 😄😄
Thank you bhaiya, great video
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
Sir when will the 2nd part come?
🤩🤩🤩🤩
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
First comment 🎉❤
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
👌
Bhiyaa thnkuuu , dp pdhna tha muje but java k 1 stop dp ni milra tha n aaj boom bhyiii bhut bhut shukriyaa apkaa🎉❤
Ji bilkul ❤ agar video psnd aaye toh aur logo ke sath share kre ❤ hmare bhaut jada help ho jaege
Please add timestamps.. Thanks for the video
Ok! will add tonight!
@shashwat_tiwari_st Thanks
paer 2 bhaiya please
Please solve more questions sir 🙏🙏🙏 second part one short
Please reply
@@mr.nishantawasthi4402 all patterns are covered.
If you want more videos, please see the pinned comment ❤
Those questions are awesome but Shashwat only 19 questions are not more enough, need something more in this.
Hey Soumya, these are standard patterns asked in interviews.
If you want more problems, please check pinned comment❤
First viewer, last learner
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
waiting for greedy algo series
public int lengthOfLIS(int[]nums){
if(nums==null||nums.length==0) return 0;
int[]dp=new int[nums.length];
dp[0]=nums[0];
int len=0;
for(int i=1;idp[len]){
dp[++len]=nums[i];
}else{
int idx=binarySearch(dp,len,nums[i])
dp[idx]=nums[i];
return len+1;
}
private int binarySearch(int[]dp,int end,int target){
int s=0;
while(s
Thank your sir best X-mas gift for us. ❤🥹
Much love and respect to you sir putting this the type of content free for us.🙏🥹
Thank you for the love ❤, your support means a lot! 🙏
public int uniquePathsWithObstacles(int[][]grid){
int m=grid.length,n=grid[0].length;
int[]dp=new int[n];
dp[0]=grid[0][0]==0?1:0;
for(int i=0;i
Oho itni jaldi! Kaisa laga lecture?
public int perfectSum(int[]nums,int target){
int[]dp=new int[target+1];
dp[0]=1;
for(int i=0;i=0;j--){
if(j>=nums[i])
dp[j]=(dp[j]+dp[j-nums[i]]);
}
return dp[target];
static int knapsack(int capacity,int[]values,int[]wt){
int[]dp=new int[capacity+1];
int n=wt.length;
for(int i=0;i=wt[i];j--){
dp[j]=Math.max(dp[j],dp[j-wt[i]]+val[i]);
}
return dp[capacity];
}
🎉❤
Hmesha ki tarah, 100% correct ❤
bhaiya dsa ke sarre topic karva dijeye
Bs 2 hi bacha hai mainly, baki sb ho gya 😃
Vote for same one shot of greedy, two pointer and divided and conquer
two pointer in already there in a playlist
Thankyou ❤, agar aapko video psnd aaye toh please aur logo ke sath share kare, hmare bhaut jada help ho jaege🎉
@shashwat_tiwari_st definitely bhaiya
Love you 3000 🌹
@@utkrishtsneh8298 but link is not provided in excel sheet
Jaldi se downloads kar leta hu key pata delete ho jae.😅
Mtlb 😅 maine kb delete kra
Sir, kambali bai chahiye. 6000 rupee mahina. Khana pina free. Agar acha kam kiya to month end me Old Monk dunga. Koi hey kya apne najar me?