Hi @kunal will u resume this playlist pls as u said will be covering dynamic programming and more cool stuffs yo know well now hiring seasons gets started many folks including me will get good exposure now to crack the coding interviews hope u find mmt thread pls do consider our humble request am requesting behalf of all your follower
@@alphaClasher941 umm.. like few topics like trees (in depth) , graphs , pathfinding algorithms and some miscellaneous topics , but these are complex and important
hi sir,im a beginner in programming, planning to learn dsa,which is best to study this playlist from beginning or study from strivers a-z dsa sheet,I am so confused,it will be helpful if u clear my doubtsir
this show's kunal's video are not scripted & he comes without any preparation . just solve questions , this really teaches how kk thought process is. where kk and you both are same stage of solving questions.
you get to feel that maximum area in histogram is really a tough question when even for Kunal it takes 1 hour to make us understand what he did in it .... hats off to you man !!!!
Kunal, u have promised us to make it through Trees, BSTs, Graphs and Dynamic Programming, waiting for those lectures, please make them as soon as possible.
@@user-ee1hgbecause in this particular test case, you can get the correct answer by picking all elements from the a stack only. Whereas, for other test cases this might not be true, and we might have to pick elements from stack b as well. So, in ans2 it should be sum+b[0]
@@krit2038 no u can't the array of 'a' is [ 4, 2, 4, 6, 1 ] after taking 4 elements the sum will be 16 then the returned count will be 3 SO I THINK HE HAS SECRETLY CHANGED IT TO sum + b[0] no he hasn't chnaged it to b[0] how 4 is coming as the ans I'M SO CONFUSED
Bro, been waiting for the continuation of this course for like ever. Please upload the rest of the topics. Your course is superb. Please don't hold back now.
i finished ur playlists around 2-3 months ago since then i have learned most of the stacks & queues and now m studying trees but ill definitely check ur lectures everytime u post it cause for 2-3 months studying was really hard and i swear no one explain in depth like ur 2-3 hours lectures of recursion series are the best m really glad ur back.
why is he taking so long to upload videos on tree and graphs? not only trees and graph he hasn't covered hashing and heaps? it's been a month. is he even gonna upload the next lectures or he just ended this course here? can you share your resources?
thanks man you are a real life saver, you dont know with this video you brought smiles on thousands of faces. I was really worried that will I be able switch some other youtube video after gettiing used to you teaching methods and here you go I saw this. You are doing a great work Kunal.
# GOD Of DSA Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)
till now I often ask myself that who is my idol? I have finally got my answer it's you, Kunal!!! You have transformed my perception, I'm fortunate that I found your video. Literally, no one could share their knowledge the way you do!! Thank you so much Kunal for your precious time and for putting out your energy for explaining every single bit of it!!!!
Completed your video on Stacks & Queues. Doing questions now. I'm very grateful that I found your channel . The way you're teaching the thought process before jumping into the solution. I really hope you complete the whole DSA playlist
I've completed your whole playlist and i have a strong grasp on the topics you have covered .But I can't find any other source better than yours for the remaining topics. So please complete the remaining topics like trees ,graphs and dynamic programming as soon as possible .And thank you for all your efforts you are putting for us ,no one can match the quality of your content and your efforts.
Heyy.. I was just getting started and he said he covered the topic of memory management and garbage collection in the bootcamp.. Can you tell me where is it?
Heyy.. I was just getting started and he said he covered the topic of memory management and garbage collection in the bootcamp.. Can you tell me where is it?
largest rectangle histogram is literally find the next lessser element from both sides this gives u the breadth for each index and the height is heights[i] res=max(res,breadth*height)
Feeling very happy because its been a long time since you add the last video. I have been checking everyday this playlist whether you add another video. I think in this time we will get all of the video that make a solid understanding of dsa and make ourself ready for the interview. Love from Bangladesh.
int ans1 = twoStacks(x, Arrays.copyOfRange(a, 1, a.length), b, sum + a[0], count + 1); int ans2 = twoStacks(x, a, Arrays.copyOfRange(b, 1, b.length), sum + a[0], count + 1); Shouldn't it be as int ans1 = twoStacks(x, Arrays.copyOfRange(a, 1, a.length), b, sum + a[0], count + 1); int ans2 = twoStacks(x, a, Arrays.copyOfRange(b, 1, b.length), sum + b[0], count + 1); this?
One small correction is, we need to decrease the count only when the recursion returns with the condition, if (sum > maxSum){}. If it returns after one of the list is empty, we return the count as is. So, if (sum > maxSum) { return count - 1; } if (a.size() == 0 || b.size() == 0) { return count; } It is because, when the program returns in the first case, it is already exceeded the allowed steps by 1. But, in the second case, it might not have exceeded the condition (sum > maxSum). Please correct me if I am wrong.
@@st-ger Because when iterating on the recursive tree, when the left subtree is empty(a.size() == 0 ) or the right subtree is empty (b.size() == 0), we need to stop recursing in that direction and start recursing in the another direction.
@@pramithasdhakal5367 what if one arrays becomes empty and maxLimit is not exceeded. shouldn't we still take from the other array instead of returning. But in kunal's code, he ends the tree there. Correct me if I'm wrong.
DSA + interview preparation playlist: ruclips.net/p/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ
please add more videos on this playlist
Hi @kunal
will u resume this playlist pls as u said will be covering dynamic programming and more cool stuffs
yo know well now hiring seasons gets started many folks including me will get good exposure now to crack the coding interviews hope u find mmt thread pls do consider our humble request am requesting behalf of all your follower
Finally the most awaited web series is back 😎🔥
🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Thanks sir I was waiting this full playlist many things are remain to do sir
When next episode come ...
After 9 months 😅
@@successpicturesmotivation6335 2025
why he was not uploading videos??
others: aim for Faang.
Kunal: worst case scenario join Faang
If he continues this to the end consistently, it would be the best news for 2023 as a coder
can you tell me how man topics are left????
@@alphaClasher941 umm.. like few topics like trees (in depth) , graphs , pathfinding algorithms and some miscellaneous topics , but these are complex and important
@@aryanshrivastava8312 share your insta would like to talk to you about these
hi sir,im a beginner in programming, planning to learn dsa,which is best to study this playlist from beginning or study from strivers a-z dsa sheet,I am so confused,it will be helpful if u clear my doubtsir
@@vishalkumar.s9679 just start from where u can understand things,once u get the idea and concept then u can understand from docs or other sources.
this show's kunal's video are not scripted & he comes without any preparation . just solve questions , this really teaches how kk thought process is. where kk and you both are same stage of solving questions.
you get to feel that maximum area in histogram is really a tough question when even for Kunal it takes 1 hour to make us understand what he did in it ....
hats off to you man !!!!
Kunal, u have promised us to make it through Trees, BSTs, Graphs and Dynamic Programming, waiting for those lectures, please make them as soon as possible.
Hashtable as well
Finally, Kunal is back with his DSA videos....Thanks a lot for continuing the DSA series 😀
lets hope he is back with old consistency
Is that he completed data structures full course or not ? Pending some topics ? Reply fast bro
@@DhirajkaReview26 yes many topics like trees,graph,dynamic programming is not covered till now!!
Your DSA playlists makes me think
"NOT TO GIVE UP "
YOU ARE SAVING LIVES
Thank you very much.
1:02:00 in ans2, it should be sum + b[0] cuz we are working on the second array.
Thanks, just going through this and that's what I thought too.
@@isaacreyes7563isn't it ?
but how did he get the right ans by doing sum +a[0] in ans2
@@user-ee1hgbecause in this particular test case, you can get the correct answer by picking all elements from the a stack only. Whereas, for other test cases this might not be true, and we might have to pick elements from stack b as well. So, in ans2 it should be sum+b[0]
@@krit2038 no u can't the array of 'a' is [ 4, 2, 4, 6, 1 ] after taking 4 elements the sum will be 16 then the returned count will be 3
SO I THINK HE HAS SECRETLY CHANGED IT TO sum + b[0]
no he hasn't chnaged it to b[0] how 4 is coming as the ans I'M SO CONFUSED
You make the best videos bro on DSA. Much better than apna,dusroka, tisroka ,ghar ka ,bahar ka college
😂😂😂
🤣🤣🤣
🤣🤣
😂😂😂
Tune meri chai gira di bro
Thanks
Welcome
@@KunalKushwaha bhaiya pls complete the bootcamp
This is what we wanted. Thanks, Kunal. Please complete this series soon.
Hi Ojasv, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
Bro, been waiting for the continuation of this course for like ever. Please upload the rest of the topics. Your course is superb. Please don't hold back now.
Which topics are left for Kunal to cover before this course completes.
@@rengoku014 trees graphs etc....
i finished ur playlists around 2-3 months ago since then i have learned most of the stacks & queues and now m studying trees but ill definitely check ur lectures everytime u post it cause for 2-3 months studying was really hard and i swear no one explain in depth like ur 2-3 hours lectures of recursion series are the best m really glad ur back.
Which resources ??
why is he taking so long to upload videos on tree and graphs? not only trees and graph he hasn't covered hashing and heaps? it's been a month. is he even gonna upload the next lectures or he just ended this course here? can you share your resources?
Hi huie, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
thanks man you are a real life saver, you dont know with this video you brought smiles on thousands of faces. I was really worried that will I be able switch some other youtube video after gettiing used to you teaching methods and here you go I saw this. You are doing a great work Kunal.
Hi Anshul, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
# GOD Of DSA
Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)
Waw mja aa gya jordar bhaiya
Jiska mujhe tha intezaar, woh ghadi aa gayi 👀
The Histogram question just enhanced my thinking ability to a next level.
Finally 🔥🔥the legendary course is back
Was waiting for so long time
till now I often ask myself that who is my idol? I have finally got my answer it's you, Kunal!!!
You have transformed my perception, I'm fortunate that I found your video. Literally, no one could share their knowledge the way you do!! Thank you so much Kunal for your precious time and for putting out your energy for explaining every single bit of it!!!!
Hi Kanya, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
2:18:00 we believe in ur words bcz u speak with ur actions, thanks bro
bhai 45 mins hue video upload karke waha thak kaise pauch gaya 😂
@@scrimsi202 are bhai 😅 vo overview le liya skip skip krke topics ka , ab padhunga aram se
Completed your video on Stacks & Queues. Doing questions now. I'm very grateful that I found your channel . The way you're teaching the thought process before jumping into the solution. I really hope you complete the whole DSA playlist
Hi Kunal start learning dsa with your playlist
it really helps a lot
please continue your playlist
Kunal BRO ! I just want to thankyou For giving us such Quality and Valuable content
Thank you for restarting the course please do this till end don't skip in between 🙏
Waiting for this since the past 1 year....thanks for resuming kunal
I've completed your whole playlist and i have a strong grasp on the topics you have covered .But I can't find any other source better than yours for the remaining topics. So please complete the remaining topics like trees ,graphs and dynamic programming as soon as possible .And thank you for all your efforts you are putting for us ,no one can match the quality of your content and your efforts.
hi bro , are you getting interview calls ?
@@dnynu bro I am just giving my 4th sem exams not eligible yet for companies🥲
@@prashantchaudhary1644 what about now bro? How did you learn the topics Kunal didn't cover?
@@vikaspawar5193 use codestory with mik and aditya verma
@@prashantchaudhary1644 How's life now bro?
Amazing video !! God of DSA Kunal Kushwaha :) Makes it very easy to learn.
Much awaited
best dsa series in yt
The thing that makes this course different from others is how beautifully Kunal explains the thought process to reach to the answers 🤩🤩🤩
Waited for a year...Finally the Best DSA Series continues..🔥😁
Please Kunal complete the series...ur helping a lot of people..personally i got benifited...please man complete the series.
Guyz he replied me that he will continue the series🎉❤
When will he continue?
@@joelp1116 didn't update me about when will he, but he will surely
@@samialvi4226 next video, next year..
@@anassaif3181 😃 🎉🥳
King of DSA
Please continue this series kunal, its a most awaited one in youtube...
Love this Bootcamp , it would be very handy for fresher how to approach in Open Source Platform.
Thank you, for coming back to this playlist! Ah! its going to be great!
Please continue this series.
The way you explain is amazing!
Heyy.. I was just getting started and he said he covered the topic of memory management and garbage collection in the bootcamp.. Can you tell me where is it?
@@thechildofprophecy9135 Video number 5 of this playlist. "Types of Languages, Memory........"
Ohmg!! So happy to have the videos backkk
Most awaited video 🎉
Thank you Kunal!! You are changing my prospective!!
Thanks a lot for continuing the DSA series 😀
Hi Muha, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
Bro really put more effort into this free playlist than other people put into their paid course.
Yessss. Thank you Kunal! Please keep up the series!
the best one in stacks and queues... just loved it Kunal...waiting for your videos ontrees
Great Video. Always the best... GOAT - Kunal Kushwaha
Thanks bhaiya 🎉
Plz consistent
You are the best..............................that's it.................................
Finally legend is back. Bhai isbaar leave mat karna please ab graph tak full course padhana please
You are the best bro!!!
I was Waiting for the video!!
bhai kitne sare interview attend kr dale isi jidd me ki pura DSA kunal ki series se he khattam kruga and finally those days comes
Thank you bro. The favorite series is back 🙌 😍 ❤️
Sahi meiiiii !!!!! Bhaiii let's gooooooooooo 🔥🔥🔥🔥🔥🔥
Abhi ye zinda Hai 😱😱😱😱😱
finally its back , we want this playlist to be completed asap :) , love your videos
Heyy.. I was just getting started and he said he covered the topic of memory management and garbage collection in the bootcamp.. Can you tell me where is it?
@@thechildofprophecy9135 bro this is the last video he uploaded if you're starting dsa right now then please checkout starting video of the playlist
@@thechildofprophecy9135 It's in the oops playlist
@@__LAmar__ Hi AMAR, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
Hi Bhavik, from where have you covered rest of the topics which were not taught in Kunal's DSA course?
Finally u came back... Thanks a lot ☺☺ hopefully ess baar playlist complete hogi n best DSA course on RUclips for free bn jayga 🤞🤞
Well described
THE KING IS BACK !!!
KUNAL IS KING KOHLI OF DSA !!
🎉
I just reached to the stacks & queue of the course and hurrya new video is out😃😃😃😃
largest rectangle histogram is literally find the next lessser element from both sides
this gives u the breadth for each index
and the height is heights[i]
res=max(res,breadth*height)
Kunal after completing this playlist please teach us about connectivity of DBMS in Java and java spring
As usual, really an excellent and unique way of teaching
Hero is back... thanks a lot bro..plzz continue.
Boss is back ✨
Feeling very happy because its been a long time since you add the last video. I have been checking everyday this playlist whether you add another video. I think in this time we will get all of the video that make a solid understanding of dsa and make ourself ready for the interview. Love from Bangladesh.
Great 👍🏻
No fing way....bro finally dropped the banger video we've been waiting for since 2 years now
Waiting for the next videos eagerly
kunal you were busy in devops but still you remember whole DSA
I don't want to place in Faang but still I will follow this DSA season 2
Very simple, Nice, Problem solved, Okay, Sounds good, Cool. If you know, you know
Thanks for continuing
Legend is Back 🤩🤩
Finally finally finally he is back this will go viral God bless you my brother 🥰🥰🥰🥰🥰🥰🥰🥰🥰🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Nice video
This is better than any netflix series
Thanks sir I was waiting this full playlist and many things are remain to do sir very very thanks sir
OMG 🥺🥺🥺 it feels awesome ❤️
int ans1 = twoStacks(x, Arrays.copyOfRange(a, 1, a.length), b, sum + a[0], count + 1);
int ans2 = twoStacks(x, a, Arrays.copyOfRange(b, 1, b.length), sum + a[0], count + 1);
Shouldn't it be as
int ans1 = twoStacks(x, Arrays.copyOfRange(a, 1, a.length), b, sum + a[0], count + 1);
int ans2 = twoStacks(x, a, Arrays.copyOfRange(b, 1, b.length), sum + b[0], count + 1);
this?
one of my favourite RUclipsr for DSA. Please complete this series.
omg😝😝 barish aayegi ab to🤣🤣
All the Java Peeps🤩 brace ahead for impact🔥💪
Thanks, Kunal for giving me the best gift on my birthday by releasing the new video on Stacks and Queues. Thank you so much
king of DSA is back
After one year ….. the return of the legend . 🎉🎉
Thanks for the series brother looking forward to more videos
Most awaited playlist 😢. It's been a year dude thanks for coming back... Legend
Most awaited DSA series, les go
hey Kunal could you please give us a tentative date on which you are going to upload the next video of this DSA series.
Most awaited one 🔥🔥
sir impresseddd
when Kunal says: is this a joke. 100% it is a joke trust me. Kunal has not only changed my mindset but also helped me to look beyond FAANG.
TYSM Kunal for continuing
Thanks bhai for making all these videos
Kunal bhaiya please complete rest all the lectures this would be very helpful for 2023 job seekers
Thanks Kunal . You made our life easy
One small correction is, we need to decrease the count only when the recursion returns with the condition, if (sum > maxSum){}. If it returns after one of the list is empty, we return the count as is. So,
if (sum > maxSum) {
return count - 1;
}
if (a.size() == 0 || b.size() == 0) {
return count;
}
It is because, when the program returns in the first case, it is already exceeded the allowed steps by 1. But, in the second case, it might not have exceeded the condition (sum > maxSum).
Please correct me if I am wrong.
Why are we using ll opertor because even if one become empty there are chances that other one will have element .
@@st-ger Because when iterating on the recursive tree, when the left subtree is empty(a.size() == 0 ) or the right subtree is empty (b.size() == 0), we need to stop recursing in that direction and start recursing in the another direction.
@@pramithasdhakal5367 what if one arrays becomes empty and maxLimit is not exceeded. shouldn't we still take from the other array instead of returning.
But in kunal's code, he ends the tree there. Correct me if I'm wrong.
yeah...... King 👑 is back 🤟