I watched all the videos of this playlist from the beginning and I must say you just made this complicated topics so easy to understand. Processed and Unprocessed String pattern is just awesome and has plenty of application's with slight variations. This video and the video before this was a cake walk for me, since I understood all the concepts very well. Thank you for making such an amazing playlist, you're really an amazing teacher. Kudos!
Kunal, your DSA videos are an absolute treasure! Your ability to break down complex concepts and provide a clear thought process for solving problems is truly remarkable. Your dedication to making these topics easy to understand is greatly appreciated. Thank you for your fantastic work!
Kunal, discovering your playlist is like finding a hidden gem-unexpected but incredibly rewarding. It's a fantastic collection for both students and professionals learning data structures and algorithms.
Really the way this guy clears concept is something I have seen multiple video on rat maze but this man cleared all my doubts by solving same question using different ways. Specially that last question he printed entire matrix path this give me a clear picture of all recursion calls.
Never in my life I could have imagined to solve or understand these problems. Thanks Kunal for such an explanation that is so generic and applicable. Watching your JAVA videos I rocked all my java interviews. This playlist is super awesome. I thank you giving my career a boost and direction.
In video also we are learning recursion...like some doubt arises go to the previous videos and again in the previous videos doubt arises go to the another previous video.....at the end if we will reach the base condition which we will have all answers and then we will return to this video with all doubts cleared. 😂😂 BTW great effort and way of explaining the problems is really appreciable...hats of to you sir🙏🙏 ❤❤
I didn't hear about back tracking before and for me now it is easy but when I have seen the comments I understand that Kunal had made it easy .What a way of explanation EXCELLENT Teaching Skills you have and thanks you for making the Playlist
I wanted to say by far this is the best playlist for learning DSA and algo I came across. Kudos to Kunal.. and thanks for creating such awesome contents :)
I dont even know these topics as im not from a cs background but i have faith in this guy, might not land a FANG company but definitely learning something new everyday
your teaching skill is just amazing i had enrolled around 10 courses but i never get such understanding of concept as i got with your lectures, thanks a bunch for providing this great DSA course for free
I must say Kunal, I was having a hard time understanding backtracking and other concepts in my college years as the teacher overcomplicated things when they were teaching these concepts. But the way you taught in these videos with such an innovative way, I can understand it so easily and I finally can feel confident whenever I tackle with such problems. Thank you Kunal and a Happy Teacher's Day
Sir, I can't believe how much i learned from your videos, Thank you so much for providing all these stuff for free. we vow you a lot.Thank you Kunal Sir.
Man this tutorial was sooooooo good!!!!! Before starting this series I never felt confident in recursion but today I was able to solve problems on my own. I can see that my problem solving skills have really improved. Thank you so much Kunal!! ❤❤
Forget about content or the way of teaching others can't match even in terms of length of any single video of this dsa playlist.. 😁😁😁 There's a reason why the Community is so much excited about this dsa course Btw now it's getting hard to match kunal's speed of uploading videos with my learning & practice speed 😅😅😅
While there is no dearth of online tutorials and resources available to explain these difficult and complex topics, few themselves have the clarity of these hard to grasp concepts and nobody so far explained them with such great clarity as you have done. Words fail me to express my gratitude for you. I just want to thank you from the bottom of my ❤ for the great work you are doing 🙏🙏💐
Amazing teaching, Amazing thought process, The way how problems are being break down as per pattern, and they are so easy to understand and solve. Hats off to you kunal. Great work towards helping others with your skills. Thanks 🙂
Kunal First of all thank you so much. I love the way you teach, you know how to teach what to teach. Amazing kunal, finally i feel i doing right teacher, And big thanks to you, your java videos helped me in cracking 10+LPA job as a fresher, thanks a lot @kunal
Loved this playlist..Making hard things look so easy..highly recommend this course to any software developer , if wanted to learn the concept ( irrespective of the language). Kudos !!
This is Amazing!! Understood BackTracking like a charm!!! Now I;ll try Sudoko solver on my own and I'm confident I can solve it because of how clearly you taught this!!!
Amazing explanation kunal. Was able to understand each and every step. Please make a video on generate all combinations of well-formed parentheses. I was seeing all videos for that question but was not able to understand it
I was facing problems initially in recursion and i got confused in but then kunal is like "IF YOU DONT UNDERSTAND PLEASE GO AND WATCH PREVIOUS VIDEOS" and he is correct. Now i am solving maze problems before even kunal solves it. I stop the video and solve it myself. The only thing we need to do is have faith.. in the instructor as well as ourselves. Until we give ourselves a chance we won't be able to do it. So like kunal say's even if u tells you 20 times same thing u won't understand. Lots of love to this entire playlist.
Absolutely loved your dsa playlist, i have been watching since start. Also we make dev initiative is super helpful. After completing your dsa course i am going to study web dev from we make dev. But some topics of dsa you have still not covered, please complete the dsa playlist soon. I really appreciate the good work that you are doing, keep it up.
Hey bro, just wanted to let you know that I was able to do some problems in the video without actually watching it. Thanks to your previous videos in the playlist.
Kunal wrote an optimised version for the 'Counting Paths' (Q1) problem. I wanted to write code so that when the person reaches the cell (1,1), only then a path is returned. When the person reaches a last row or column, then the other dimension should be decreased till the base condition hits. Since the return type is int, we need to return the function in these if and else if clauses. public static void main(String[] args) { int r = 3; int c = 3; System.out.println(pathsofmaze(r , c)); } static int pathsofmaze(int r , int c) { if(r == 1 && c == 1) { return 1; } if(r == 1) { return pathsofmaze(r , c - 1); } else if(c == 1) { return pathsofmaze(r - 1 , c); } int left = pathsofmaze(r , c - 1); int right = pathsofmaze(r - 1 , c); return left + right; }
watched your entire recursion playlist I must say, you just made recursion very easy(atleast for me). Permutations, subsequences you made them easy for me, I was able to solve many of its applications with slight variations. Thank you Kunal for making this amazing playlist you always make complicated topics easy for us.
At some points when I see you, I kinda get laugh. Anyway I love your teaching bro. Thanks a lot man. You are helping every person who are need of learning DSA and JAVA.
Thank you so much Kunal for these wonderful explanations. Requesting you to please provide the dynamic programming lecture link that you discuss in your lectures.
DSA + interview preparation playlist: ua-cam.com/play/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ.html
Kunal Please complete this playlist
Hi Kunal, desperately waiting for your DP playlist.
Eagerly waiting for the OP-DP playlist Kunal! loved this tons❤
finally a teacher who understand that this topics are important to cover in depth and u have done this job 🔥🔥🔥🔥🔥
I watched all the videos of this playlist from the beginning and I must say you just made this complicated topics so easy to understand.
Processed and Unprocessed String pattern is just awesome and has plenty of application's with slight variations. This video and the video before this was a cake walk for me, since I understood all the concepts very well. Thank you for making such an amazing playlist, you're really an amazing teacher. Kudos!
Glad it was helpful!
@@KunalKushwaha yes just love the playlist by far the best OOP playlist ....just do complete the rest of the playlist...waiting for DPs and Hashmaps.
@@KunalKushwaha hey...pls finish this playlist before starting new ones! These videos are amazing and it must nit be discontinued.
I too feel the same
@@KunalKushwahaHello sir can you help me in a program . I'm struggling. can you send your email I'd...
There is no doubt about Kunal's teaching skills, The way he looks at camera, feels like he is Infront of me and teaching 💚
Kunal, your DSA videos are an absolute treasure! Your ability to break down complex concepts and provide a clear thought process for solving problems is truly remarkable. Your dedication to making these topics easy to understand is greatly appreciated. Thank you for your fantastic work!
The way you explain the thought process, just WOW. Anyone can fall in love with recursion after watching this playlist.
This is the first time i am learning backtracking....and i am glad i bumped into THIS video....very well explained....thanks Kunal...👌🙌
Great to hear!
One of the best introduction of backtracking. Just like a thrilled movie with suspense..!!!
Kunal, discovering your playlist is like finding a hidden gem-unexpected but incredibly rewarding. It's a fantastic collection for both students and professionals learning data structures and algorithms.
Really the way this guy clears concept is something I have seen multiple video on rat maze but this man cleared all my doubts by solving same question using different ways. Specially that last question he printed entire matrix path this give me a clear picture of all recursion calls.
Never in my life I could have imagined to solve or understand these problems. Thanks Kunal for such an explanation that is so generic and applicable. Watching your JAVA videos I rocked all my java interviews. This playlist is super awesome. I thank you giving my career a boost and direction.
bhai hamne 1:11:24 m condition false kyu add kri, jes ehi nice ki true condition hit kregi wo fir se false wale ko hit kregi, please explain
@@nikhilchauhan3506
If you haven't figured it out-
Short answer - true wali statement tabhi execute hogi jab control return ho raha hoga.
best explanation available on youtube, literally the concept got imprinted in my mind, Kunal is too OP.
watching long videos of recursion was worth it , can't thank you enough for these .🙏
In video also we are learning recursion...like some doubt arises go to the previous videos and again in the previous videos doubt arises go to the another previous video.....at the end if we will reach the base condition which we will have all answers and then we will return to this video with all doubts cleared. 😂😂
BTW great effort and way of explaining the problems is really appreciable...hats of to you sir🙏🙏 ❤❤
I am enjoying your full course. I have one request for you --> Please complete it with DP.
Thank you for making the recursion concept so easy😊 also, for breaking the myth 21:52, I believed in it for the longest time
I didn't hear about back tracking before and for me now it is easy but when I have seen the comments I understand that Kunal had made it easy .What a way of explanation EXCELLENT Teaching Skills you have and thanks you for making the Playlist
Thanks for sharing
Never thought such a teacher will be available for me to help me with java dsa.
Your codes are masterpiece , the more one understand them , the more they like it.
Still , wisest are they who know that they don't know.
kunal... when i saw the last problem solution without my knowledge i clapped and shouted ....... u r great ...
I wanted to say by far this is the best playlist for learning DSA and algo I came across. Kudos to Kunal.. and thanks for creating such awesome contents :)
I dont even know these topics as im not from a cs background but i have faith in this guy, might not land a FANG company but definitely learning something new everyday
Mene apka playlist dekh krr phla question khud se bnaya aur baki ke bhi bna dala thanxx bhaiya 😍❤❤
Love you're channel! I cant believe how much similar the approaches are. I would have never thought mazes and subsequences are soo similar!
Dil se khushi hota hai yr aisa video dekh ke and most important topic smjh ke 🔥🔥🔥🔥🔥🔥🔥
your teaching skill is just amazing i had enrolled around 10 courses but i never get such understanding of concept as i got with your lectures, thanks a bunch for providing this great DSA course for free
I must say Kunal, I was having a hard time understanding backtracking and other concepts in my college years as the teacher overcomplicated things when they were teaching these concepts. But the way you taught in these videos with such an innovative way, I can understand it so easily and I finally can feel confident whenever I tackle with such problems.
Thank you Kunal and a Happy Teacher's Day
This is the best course on UA-cam thanks Kunal Kushwah
I am really glad for having learned such a wonderful concept. Thank you for this video.
Sir, I can't believe how much i learned from your videos, Thank you so much for providing all these stuff for free. we vow you a lot.Thank you Kunal Sir.
Even a cpp student also watching these videos because such awesome content is not available for cpp.
Absolutely incredible. Watched all the videos and able to understand the process and idea behind. Thanks a lot!
literally solved all the questions before his explanation because of his previous recursion videos knowledge . kunal your recursion playlist is 🔥🔥🔥
Hp wawawa 👌
Man this tutorial was sooooooo good!!!!! Before starting this series I never felt confident in recursion but today I was able to solve problems on my own. I can see that my problem solving skills have really improved. Thank you so much Kunal!! ❤❤
Just awesome. The best video available for backtracking. Hats off to you Kunal.
Glad you liked it!
You not only explained the concept of backtracking but also explained why do we actually need it. Splendid explanation as always. Thank You!
Forget about content or the way of teaching others can't match even in terms of length of any single video of this dsa playlist.. 😁😁😁
There's a reason why the Community is so much excited about this dsa course
Btw now it's getting hard to match kunal's speed of uploading videos with my learning & practice speed 😅😅😅
Thanks! Do it at your own pace.
@@KunalKushwaha please do dp I'm struggling a bit with it
SIR WHEN COVER REMAINING TOPICS@@KunalKushwaha
Best backtracking and recrusion explanation video all over the internet for beginners.
There's nothing simple concept explanation like this... Ever seen💯👌🏻
While there is no dearth of online tutorials and resources available to explain these difficult and complex topics, few themselves have the clarity of these hard to grasp concepts and nobody so far explained them with such great clarity as you have done. Words fail me to express my gratitude for you. I just want to thank you from the bottom of my ❤ for the great work you are doing 🙏🙏💐
Hi Kunal, your course is THE BEST. please release the video of OOP, when can we expect the OOP video?
Best Backtracking I have ever seen and understood
Amazing teaching, Amazing thought process, The way how problems are being break down as per pattern, and they are so easy to understand and solve. Hats off to you kunal. Great work towards helping others with your skills.
Thanks 🙂
ngl recursion has become my favourite after this playlist.
Amazing, such a smooth way to build up to the last complicated solution.
Best explanation. I never knew what backtracking was, but after watching this video I understood the concept in depth. Thankyou Kunal Bhaiyya!
After watching your video's I've got next level of confidence to solve recursion problems.. You are a very good at simplifying concepts.. Thank you
Kunal First of all thank you so much. I love the way you teach, you know how to teach what to teach. Amazing kunal, finally i feel i doing right teacher,
And big thanks to you, your java videos helped me in cracking 10+LPA job as a fresher, thanks a lot @kunal
I really enjoyed this lecture like binary search
The way u explain is next level seriously 💯
Loved this playlist..Making hard things look so easy..highly recommend this course to any software developer , if wanted to learn the concept ( irrespective of the language). Kudos !!
This is Amazing!! Understood BackTracking like a charm!!! Now I;ll try Sudoko solver on my own and I'm confident I can solve it because of how clearly you taught this!!!
you are a genius kunal .
Really I'm solving recursive programs .It's only because of u .
kind of satisfaction after learning all this stuff is priceless
Amazing explanation kunal. Was able to understand each and every step. Please make a video on generate all combinations of well-formed parentheses. I was seeing all videos for that question but was not able to understand it
I was facing problems initially in recursion and i got confused in but then kunal is like "IF YOU DONT UNDERSTAND PLEASE GO AND WATCH PREVIOUS VIDEOS" and he is correct. Now i am solving maze problems before even kunal solves it. I stop the video and solve it myself. The only thing we need to do is have faith.. in the instructor as well as ourselves. Until we give ourselves a chance we won't be able to do it. So like kunal say's even if u tells you 20 times same thing u won't understand. Lots of love to this entire playlist.
BEAUTIFUL EXPLANATION MAN..........HATS OFF....🔥🔥🔥
There's no match for the way you explain things Kunal.
i cant express my thanks to this guy.. what a video.. 💥🔥
Awesome Kunal. I just started learning these DSA. Its so interesting with your videos. Kudos
What an explanation 🔥🔥 starting with this topic again and watched this ..great start indeed💥
Absolutely loved your dsa playlist, i have been watching since start. Also we make dev initiative is super helpful. After completing your dsa course i am going to study web dev from we make dev. But some topics of dsa you have still not covered, please complete the dsa playlist soon. I really appreciate the good work that you are doing, keep it up.
Hey bro, just wanted to let you know that I was able to do some problems in the video without actually watching it. Thanks to your previous videos in the playlist.
Great to hear!
Kunal ...you have got now 200K Subscribers....
Now plz continue the DSA Bootcamp..🥺...
Kunal wrote an optimised version for the 'Counting Paths' (Q1) problem.
I wanted to write code so that when the person reaches the cell (1,1), only then a path is returned.
When the person reaches a last row or column, then the other dimension should be decreased till the base condition hits.
Since the return type is int, we need to return the function in these if and else if clauses.
public static void main(String[] args) {
int r = 3;
int c = 3;
System.out.println(pathsofmaze(r , c));
}
static int pathsofmaze(int r , int c) {
if(r == 1 && c == 1) {
return 1;
}
if(r == 1) {
return pathsofmaze(r , c - 1);
}
else if(c == 1) {
return pathsofmaze(r - 1 , c);
}
int left = pathsofmaze(r , c - 1);
int right = pathsofmaze(r - 1 , c);
return left + right;
}
Man !!!!!!!!, bhaiyaa i am always fascinated by the way you teach in every video why aren't you the CEO of Goggle already😭😭
That was awesome @kunal!!!!
watched your entire recursion playlist I must say, you just made recursion very easy(atleast for me). Permutations, subsequences you made them easy for me, I was able to solve many of its applications with slight variations. Thank you Kunal for making this amazing playlist you always make complicated topics easy for us.
We are blessed having teacher like you kunal sir!🤗
@@nikhilchauhan3506 can you elaborate in English please !
@@malavipande6693 i got the answer, btw thanks for your assist
@@nikhilchauhan3506 Even though I have to know cloud you please tell me in english.
@@malavipande6693 cloud?
@@nikhilchauhan3506 typo error that's could
At some points when I see you, I kinda get laugh.
Anyway I love your teaching bro. Thanks a lot man. You are helping every person who are need of learning DSA and JAVA.
Amazing explanation of backtracking kunal thanks a lot🙏 😊😊.
Kunal is wow a intellectual human being ..
Eagerly waiting for the video on DP. Please upload it soon. 🙏🙏
Thank you soooo much, your explainations are incredible. Thank you, brother !!!!
Such a nice video. You have created interest of tech inside me. Loved watching your video.
best best best the best Explanation in the world
28:44 the way problem was solved left me in awwww 🙏🙏🙏🙏
God bless your kind heart Kunal
Fun Fact: After this course DSA is all about copy paste🤣. Nothing is hard😎
Thank you so much Kunal for these wonderful explanations. Requesting you to please provide the dynamic programming lecture link that you discuss in your lectures.
Best Backtracking lecture bhai !!
hats off to you Kunal
Now we are readyyyyyyyyy for DP. Eagerly waiting
Thanks, Kunal for this Amazing series. Keep up the good work Man.
Pleaseeee make video on DP plzzzz, ur teaching is the perfect way, we have forget to memorize... just understand and apply thankss a lot!!
you explained backtracking so easily bro 🙌
Amazing explanation of Backtracking, thanks man!!!!
Seriously bro ,you are incredible.
legendary as always
Dear Kunal, We have no words to thank you! You litertly save us in our degree. Are there videos about dynamic programming already?
You really made Maze's questions so simple thanks, brother.
You are most welcome
@kunal make videos for DP and Graph....
kunal you explained it very well and ah u made my life easy hats off
Thank You
hey kunal do mark this timestamp as well 🤷♂️🤷♂️ 1:18:23 . Your first ever small rap on Arrays, somewhat similar to Bart's rap
At 16:03 "No one can help you" is so true...
Excellent explaination about Backtracking 🔥
That Fibonacci approach:
int path2(int i, int j)
{
if (i == 1 || j == 1)
{
return 1;
}
return path(i - 1, j) + path(i, j - 1);
}
Awesome videos👏👏👏. Please post videos on binary tree, graph and dynamic programming. Thank you!
Man , i get chills when you explain , it gets so much easier with your explanation
Thanks a ton kunal👍🏻