Recursion is the part where even the most intelligent of folks struggle and give up programming. In India, I have personally seen intelligent people reluctant to share their knowledge out of hyper competetiveness. You don't know how many lives you're building by generously sharing this top level knowledge free of cost. God will always bless you for this selfless noble act, Kunal Sir 🙏

@mysteryman2213

Жыл бұрын

good words and nice name though

@aakashbhandari9761

Жыл бұрын

​@@mysteryman2213 😂

@plutomessi21

10 ай бұрын

@@mysteryman2213 🤣

@albin6126

8 ай бұрын

i noticed because you said legend @@mysteryman2213

@shubhamsemwal5254

6 ай бұрын

hahahha

Gotta appreciate how you linked the pattern thing to bubble sort and selection sort...at first I was confused about it but then in a moment I was like "woah got it". Top-notch playlist

Yes, as you mentioned we r waiting for that course on DP that no-one has created so far !!!

@KrishNamaste

Жыл бұрын

Same here!

@shantohossain1372

Жыл бұрын

same here but it's more than one and half year gone!!

@udaysingh2929

5 ай бұрын

still waiting

@prtk2verma

5 күн бұрын

@@udaysingh2929 khada hu aaj bhi wohi....

Kunal, I cannot express my gratitude enough. Your teaching has been exceptional and transformative for me. I have finally grasped the concept of recursion - something that eluded me until now. You are an incredible teacher and mentor. PLEASE PLEASE PLEASE teach us more subjects like Hashmap and Dynamic programming. I am eagerly looking forward to taking those courses as well. 🙏

so here i completed more than half of the videos of this dsa playlist, day by day dsa is looking easy thanks to kunal for this amazing playlist and waiting for you to complete this playlist

This playlist helps me a lot, thanks man for providing such a brilliant course

kunal beside programming your are really a good teacher like u started with patterns thats simillar to two sorting technique its amazing and really helpfull thanks

Must say it is the best playlist for recursion over the internet so far ...

I'm not a Java Programmer but Getting inspired by you, I have created a new Hackerank Account and started solving the problem solving questions again but this time I am using Recursion only. I have had six stars in problem solving before but I always struggled on Recursion. Thanks a lot Kunal Sir. You gave me inspiration. My core weakness was permutation and combination... Today after watching your algorithm on Recursion: Subset... I implemented the code in C# and I started jumping out of enthusiasm when it ran successfully.. I also implemented dynamic programming to it so it doesn't repeat on the same characters in the string. I can't elaborate with words how thankful I am.

I watch many videos for recursion but your one is the best because the way of teaching is good

your explaination is so clear i was able to solve the bubblesort and selection sort problem with recursion without looking your solution first. Thanks a lot brother you're really awesome

Have to say one has to put everything to create a course like this !!! Thanks for the awesome and intuitive course but kunal bhai please complete this playlist. We really need videos on the rest of the topics!!!!!!!

Oh gosh, I was banging my head against the wall! I really thought we were going to print the pattern using bubble sort. Now I understand that we're solving bubble sort using recursion, haha

MindBlowing , u just connected a simple pattern question to BubbleSort , gave JEE feel when my teachers used to connect Advance problems to a simple concept. I am eagerly waiting for the DP series.

Hey Kunal, can you share a tentative timeline for this bootcamp? That will be very helpful. Anyways the videos are super awesome !!

Thanks Kunal Bhaiya for sharing the knowldege.

Thanks for the amazing content kunal 🔥 kudos!

Kunal bro on fire 2 videos within 24hrs 🔥🔥

really liked how you changed the intuition of pattern algorithm to make us understand the recursions for both the sorts, kinda makes people get up from all the boring tutorial vibe, haha loved it

@khushipurohit8761

2 ай бұрын

that was really cool

Thanks for sharing ur beautiful knowledge kunal bro ❤️❤️❤️

Recursion guru Kunal Kushwaha. Eagerly waiting for dynamic programming series.

After getting a feel of recursions,I'm able to solve all of them before the video🥲 thanks Kunal🙂

Hey @Kunal, thanks for all the awesome content you are providing for free. This is pure GOLD i must say. Can you point me to some of DP videos you have, I am not able to find anything on DP on your channel?

Time for a job change... This is best playlists to work thru...

Man you taught me how to debug a code , and it is very usefull while doing recursion questions thanku so much

Bro make a video on how a new coder start it's journey and when we do internship

Although...am lil far from this lecture...but thankyouu for the consistency sir❤️✨

Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!

@deepanshu5394

Жыл бұрын

++

This playlist helps me a lot, thanks sir for providing such an amazing course..😇

As always, simplified and awesome explanation💚

Good thought process by making that pattern question relatable to BubbleSort and SelectionSort.. Good knowledge is being grasped from you day by day 🙂

@KunalKushwaha

2 жыл бұрын

You're most welcome

@santhosh7042

2 жыл бұрын

Can you helpme out find what's wrong with this selection code after debugging i get to know that the zero index value is swapping with it's next value when the before pass is sorted let me explained what i saw on debugging is arr= 4 , 3 , 2 ,1 where s = 0; e = arr.length-1 when s = 0 (index) e = 2(index) arr is sorted i got the desired answer but when s = 0 and e = 1 it again get maximum value as 1 and rather than swapping with it self it is swapping with next index value and resulting in 2 , 1 , 3 , 4 static void selection_sort(int[] arr) { helper(arr,0,arr.length-1,Integer.MIN_VALUE,-1); } static void helper(int[] arr, int s, int e,int max,int max_index) { if(e==0) { return; } if(s

@aeroabrar_31

Жыл бұрын

@@KunalKushwaha Please continue this Bootcamp !!😪😭

@akashstark1836

11 ай бұрын

​@@santhosh7042in if condition you have to give like s

When any pattern question comes in interview what should i use iteration or recursion? could anybody tell

Hello Sir bubble sort code is giving stackOver flow error when size of the array is increased . Here is the constrain for the length of an array 1

in the first program, the stack size is the total number of (*) or O(row^2) so we should return until we start printing the next row for good programming practice.

Kunal bro, is it possible to complete this Bootcamp by November 2nd week? Hope you complete this Bootcamp by mid November!🙏

@yogeshyts

Жыл бұрын

next year k november a gya abhi tk ni hua🤣🤣🤣🤣🤣🤣

@aeroabrar_31

Жыл бұрын

@@yogeshyts han LOL🤣

@yogeshyts

Жыл бұрын

@@aeroabrar_31 February m start hoga ab bola h usne

@aeroabrar_31

Жыл бұрын

@@yogeshyts Kidhar bola hai bhai usne.. Mai toh puri tarah usi par depend hua hoon 🥺

@yogeshyts

Жыл бұрын

@@aeroabrar_31 twitter p active h wo

Kunal a humble request to please start the topics like Dynamic programming, hashing and stuff. It will be very helpful. Your explanations are good that's why.

@KunalKushwaha

2 жыл бұрын

I will

@burhanuddinraja7209

2 жыл бұрын

@@KunalKushwaha Thank you for this course

Kunal, The TC for best case scenario in Bubble sort is 0(n), however using the recursion example it is still o(n2). Is there a way to include an extra flag as parameter and break recusion if the array is already sorted like we did in iteration example.

Thanks for this Recursion video

Bro you bring back my confidence and intrest in programming..❤️

cant figure out the space complexity and recurrence relation of recursive bubble sort. Any help will be appreciated!

hi i wanted to ask that fun(4,4) will be called in stack or not ?

Awesome content 👏👌

i think for first if(c < r) it should be if(c

Man, please continue this if it is possible.

Bro could you tell any documentation for java from where I could learn it

What an explanation man!

Today I have done all easy question from the assignment and tomorrow I will try the medium one

thanks for this amazing video 🤗👍🏻🔥❤‍🔥

Thank You so much brother!

wow this is wonderful really.

Kunal is the OG of DSA teaching

Great video

If I try to execute triangle2 problem in python programming language it is returning the None can anyone help me?

can anyone explain why swapping is with a[r-1] and not a[r]

brother, Please start DP series. You are magician.

For selection sort we can start column value from 1 since we assign max as 0 in initial all the time , we don't have to check 0 th position with 0th

woooooo hoooooooooooooooooooo great video ✨😊

12:58 why wont f(3,3), f(2,2), f(1,1) be called.... without them i dont think any function call will return at the else statement

I was hoping you finish this playlist.

Hey Kunal, when will you resume making these videos again.

Thank you my Guru 👏👏👏👏

Will following solution work for Triangle 1? function logger(r, c) { if(r === 0) return; const arr = []; while( r > c) { arr.push('$'); c++; } console.log(...arr); r -= 1; logger(r,0); } function printTriangle(n) { logger(n, 0); } printTriangle(10);

Awesome 🔥

You amazing brother thanks

In every classroom there are such students who ask like this 😁😁

7:23 eagerly waiting for it bhai!!!

Awesome bro..when will you teach us dynamic programming?

@KunalKushwaha

2 жыл бұрын

Yes but later

@mahajveemahajvee8941

Жыл бұрын

@@KunalKushwaha ok 🙂🙂🙂🙂

@ziadotenv

3 ай бұрын

​@@KunalKushwaha dp 😢

Nice Video

brooo please bring DP playlist now its enough time im crying for your videos for DP

I love this course

In the bubble sort, can we use for loop inside the recursion function, and pass a window size as an argument to the recursion function after every sub call to the bubbleSort function

awesome😍😍😍😍

kunal can you explain what is question

u make things easier and simpler to understand .... thank u so much for this Recursion playlist 🔥🔥🔥... Learnt a lot from you, like how to approach a problem and different ways of solving a particular problem and so on... keep it up brother 🙂🙂🙂 Love from Kashmir ❤️

@KunalKushwaha

2 жыл бұрын

You are most welcome

*This is my C++ Code. The course is Fantastic.* void buble(int *arr,int n,int end,int itr) { if(end==0) { return; } if(arr[itr]>arr[itr+1]&&itr

Bhaiya (arrays ,pattern , strings..etc )on recursion topic ki easy ,medi ,hard arrange kar dijiye bhaiya please , aur Assignment mein aur ques practice ke hote toh acha rehta

10:00 this is also a one method for print the stars method static void triangle(int r ,int c){ if (c 0) { System.out.print("* "); printStars(n - 1); } }

when will you upload dp stuff????

Can any one find what's wrong with this selection code after debugging i get to know that the zero index value is swapping with it's next value when the before pass is sorted let me explained what i saw on debugging is arr= 4 , 3 , 2 ,1 where s = 0; e = arr.length-1 when s = 0 (index) e = 2(index) arr is sorted but when s = 0 and e = 1 it again get maximum value as 1 and rather than swapping with it self it is swapping with next index value and resulting in 2 , 1 , 3 , 4 static void selection_sort(int[] arr) { helper(arr,0,arr.length-1,Integer.MIN_VALUE,-1); } static void helper(int[] arr, int s, int e,int max,int max_index) { if(e==0) { return; } if(s

when we wil get dynamic programming videos?????

nice content we love your efforts can you suggest me any course of android development❤❤

@KunalKushwaha when will you start dynamic programming series?

bhai, I can't see dynamic problems video? Can you please upload one .. and bdw loved your content.

i hope i meet you one day and thank you!

At this stage I'm able to solve given problems before i see your solution 🙌 hats off and huge thanks to you for helping me in developing the approach ❤️💯

Thank You XD

thank you so much

Kunal when we will have Trees and Graphs here in this DSA playlist??????

where are the dynamic programming videos???

Q. 1 solution Def triangle(n) : If n==0: return Print("* "*n) triangle (n-1)

static void sort(int[] arr, int r,int c,int max){ if(r == 0){ return; } if(c

Amazing

asusual kunal rocks!!!!!!!!!!

@amaanullah13

Жыл бұрын

Bro put space after "as" I've read it asexual Kunal rocks🤣

Where are DP video?

Make video on quick sort and mergesort using recursion

Kunal, Can I learn C++ and Java together? I know it's difficult but would there be a bigger problem in the future?

@prakhar266

2 жыл бұрын

Learn either java or c++ thoroughly first .other language will take max 15 days for completion

@rashidansari4176

2 жыл бұрын

@@prakhar266 Completely agree with with you bro, learn anyone first. then switching is to another is quite easy.

@mohammedsuhail8706

2 жыл бұрын

Syntax will screw u If u try to learn it together

@amansayer4943

Жыл бұрын

@@mohammedsuhail8706 bhai wahi hogaya mere sath .

when will dp series come?

bubble sort gives stackoverflow at line no. 53 in your code , kindly take example as 4872.

❤...bro linkedlist,graphs,dp videos?

please complete the course sir