Recursion - Array Questions (Theory + Code + Tips)

[@KunalKushwaha]

DSA + interview preparation playlist: kzbin.info/aero/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ

[@surajgupta3267]

This man is providing quality content for free...far better than the paid ones ♥️

[@teslatestingwala5019]

He gets Powerfull blessings

[@jayakumar9976]

i can personal vouch for it!!..

[@logeesh2009]

Agreed

[@er.albertaddy2386]

but many important topics mentioned in website are missing, say maps, trees etc. hes also not interested to share.

[@devincodes5218]

No lies... Plus making seemingly hard concepts easy to grasp.

[@budgetdapr]

Been going on and off studying CS because I was stuck on recursion. Used to stop studying in a matter of minutes since I couldn't understand anything related to it. Watched 3 videos of your RECURSION PLAYLIST and now recursion is a cakewalk to me. The best 3-4 hours I've ever invested, not even capping

[@KunalKushwaha]

Glad I could help

[@Kondlapudi]

I agree!!

[@panchanansahoo1463]

Thanks kunal for all the videos .But please upload remaining videos after stack and queue as well

[@meetabhashiniparida9417]

@@KunalKushwaha in 1:03:42 why is it returning [3, 4] and not [4, 3]....since its returning from the stack's top, it should first add 4 into the list n then 3 right?

[@ujjwalagnihotri5001]

@@meetabhashiniparida9417 if you haven't still figured out yet, then because call for index =3 will happen first and it will get added in arraylist.

[@albin6126]

your non formal and more friendly way of teaching feel very connected and its like you directly talking to a person

[@vittalmaheshwari5348]

Hey Kunal it has been a superb journey with you I got a job offer from Microsoft This is all because of your videos and your hardwork Thank a lot Kunal I will support you till my last breath

[@KunalKushwaha]

Glad to hear that!

[@ankitpani6656]

From Which College Are You?

[@omkarjoshi7371]

Offer from these playlist only? Yes no doubt good playlist.

[@mycomputer1429]

Your linked name please

[@mycomputer1429]

Links

[@erharshphysics3835]

32:00 😁😁 "You've skipped the course I can't help you. Go watch the video properly" and then you says "ok, I'll repeat it."😂

[@veeee5577]

he's the best teacher he just wants his students to not get confused

[@vedantyt2451]

Sometimes it's that aura of Kunal which makes us comfortable in getting the hard concepts easily.

[@subhankarkanrar9494]

If anyone watches the first time, i will say , please see all the videos carefully previously and watch the full video. Don't skip anyone

[@bruvhellnah]

bro did you understand recursion completely from his videos?

[@AIDEVESH779]

@@bruvhellnah you will understand it but you need to pratice it for better understanding in platform lke leetcode etc question are given in the assigment part

[@projecthope2836]

Thanks Kunal, you're really a rare gem, I have understood recursion by just watching your contents

[@aashashanmugam]

This series is hands down THE best videos on Recursion!! Thanks so much Kunal!!

[@ashaysaoji2273]

Excellent explanation for returning a list without passing an argument! Starting Timestamp: 49:47

[@kushalappabe1993]

The part where this video leads to explaination of passing arguments as parameters avoiding multiple object creation made me feel I have to genuienly thank you! Highest of respect and Highest of Regards for what you have done. Thank you!

[@AftabAlam-gh1nh]

My code for question at 3:18 public static boolean Check(int arr[]) { int index = 0; return helper(arr, index); } private static boolean helper(int arr[], int index) { if(index==arr.length-1) { return true; } else if(arr[index]>arr[index+1]) { return false; } return helper(arr, index+1); }

[@vigneshvijayakumar-ty4ob]

Hey Kunal, you are such an amazing tutor. You think about all the perspective of watcher, like where they will get doubt and you are explaining it repeatedly without hesitation. Thank you so much Kunal.

[@ritukumari1995]

A better KZbin DAS and Java course than Scaler and Crio courses.I sincerely appreciate it.

[@riyazahmadkhan9490]

Understanding recursion helping me to understand other data structures in detail and fast too Thank you so much Kunal for providing quality content

[@ashisbhowmik348]

You deserve a Big shoutout ❤️❤️❤️ for providing this type of quality education ..💯💯💯

[@ridoychandradey8337]

So many things I have learnt so far. This is the best recursion content among all videos in youtube. Thanks a lot KUNAL.

[@JodFlashYT]

Bro did you have handwritten notes of kunal it's giving me error in github 🥲 plz reply if you have

[@ridoychandradey8337]

@@JodFlashYT I have few of these. But not all. When I was taking the notes my handwriting was very messy as well. If you want to know anything then you can tell me and I will give you the fb or linkedin profile link.

[@Helly_Patel]

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

[@rakeshbabu4790]

Increase the frequency of dsa videos Kunal🙏🏻🙏🏻🥺🥺

[@sreejak6776]

Yes! I agree

[@studyafa7159]

Nhi hoga. 🧹🧹

[@demonking7900]

​@@studyafa7159why not

[@_DashingAdi_]

​@@studyafa7159lul

[@roshanchauhan1123]

F = 1 / T but T is regular speed so it will be saame

[@maheshgayakwad4227]

bhaiya aapne bola tha ki recurssion me problem aayegi per mujhe to bahut easy lg raha hai ye.... maybe all because u are such a good teacher .. thakyou

[@veeee5577]

thanks for taking so much time for making this course its worth thousands of dollars and yet you made it free may god bless you.

[@akashnag6459]

No one explained Recursion as easy as you. Thanks a lot. A lot of paid courses doesnt explain Rescursion as you did.

[@KunalKushwaha]

You’re welcome

[@sujithsaikalakonda4863]

Hey, Kunal. Great Explanation. Especially the way you explained 'Return the list without passing the argument' was awesome and clearly understood. Great Work

[@gurjargaming863]

Bhaiya you are great aapki wajah se mera recursion itna best hoo gaya he ki me aab koisa bhi question bhot aaram se krr leta huu

[@KunalKushwaha]

You’re welcome

[@samuelmanukonda286]

One of the best courses I have come across so far. You are doing an incredible job. Just a suggestion. People who are having issues understanding the last return statement, try assigning a local variable to it and then return it, so you can see the stack getting cleared after each function call which makes it easier to understand.

[@sameerakhatoon9508]

yep, thanks!!

[@dipeshjadhav1546]

Hats off to the efforts this guy has put in making these videos, Wish we had teachers like this in our collage. I wish you all the luck man and wish all your dreams come true.. Contributing to the better world. Thank you so much man

[@KunalKushwaha]

Thanks a ton

[@Virtualexist]

Mannnn, no matter how much striver, ye bhaia wo bhaia teach N queen or any difficult problem and boast about it.. this man teaches you what makes you solve these problems by self. It is not about solving one problem, it is about learning to solve many such problems.

[@subhamsoni3853]

striver's playlist is complete unlike his

[@Virtualexist]

@@subhamsoni3853 Ah I seee. I completed from Aditya Verma and i come back to this to clear basic doubts.

[@AshirwadSarmah]

@@subhamsoni3853 is this playlist really not complete? what is he missing?

[@webhelpbyvarghab]

*C++ Code for returning vector without passing answer vector to the recursive function* vectorsolve(int target, vectorarr, int index){ vectorres; if(index==arr.size()) return res; if(target==arr[index])res.push_back(index); vectortemp = solve(target, arr, index+1); if(!res.empty()) temp.push_back(res[0]); return temp; } int main(){ vectorans = solve(4, {3,6,8,9,4,2,4}, 0); for(int x:ans){ cout

[@FaizanFurqanAhmad]

Honestly :-> Your teaching way is fantastic and advance level. You are the real example of what's the knowledge we can get from youtube 💯 ❤ Love uhhh bro ❤

[@stranger_0911]

when you understand the thing he is explaining totally, It feels so so satisfying

[@jknair0]

You are doing Gods work! So much knowlege with so much clarity for free. Thank you Kunal!

[@chinmayatewari7589]

The level of dedication and the quality of content💯.... TONS OF RESPECT AND SUPPORT ❤

[@ujjwalkumar7267]

Hats off to his calmness, you are such a brilliant tutor, I am new to this channel, going to watch all the videos and learn different concepts..!!!

[@rishabhrawat8197]

you were right now i'm able to solve complex questions in my finger tips

[@KunalKushwaha]

told ya

[@yaswanthkosuru]

these playlist of recursion deserve million of views

[@vikaskumarnitrr]

By the time I had subscribed to your channel, I always wait for your next upload just a little request, just increase the speed of uploading videos. love you 3000 Kunal bhaiya

[@YashwaniVerma-q5s]

I can't thankyou enough for this amazing lecture. I understood the whole lecture. If you can make a lecture on DP it will be a big help.

[@programmer9803]

Best DSA Course on JAVA on Entire KZbin💕

[@pradeepella]

Man the dedication ur putting teach all these and ur notes is very much helpfull and ur teaching this for free hatsoff for u, ur best than many other paid courses at present . God ur kunal

[@codeman0017]

bro not many all

[@abdullahalosaimi8506]

Thank you for the amazing work you do. Another solution for question 5 is returning an empty list when the index is greater than or equal to array length instead of creating a new list in every call. def find_all_indcies(target, index): if index >= len(nums): return [] results = find_all_indcies(target, index + 1) if nums[index] == target: results.append(index) return results

[@entity2.089]

Guess what i checked every dsa course, really couldn't find anything better than this and anyone better than you kunal❤❤❤❤❤❤❤

[@jamespeterson7824]

Recursion has been explained very nicely ,simple and understandable manner... Good work 🙂

[@manashbarman273]

Bro please add the tree and graph videos as well.. I am 4 yrs experience at a service based org. But I must say you content is top notch in terms of explanation. I became fan of yours

[@Tomharry910]

Best way to learn recursion anywhere. Thank you so much Kunal Sir 🙏

[@atitsharma009]

44:38 code in Python def LiS(arr,target,index,NewList=[]): if index==len(arr)-1: return NewList if arr[index]==target: NewList.append(index) return LiS(arr,target,index=index+1) print(LiS([4,2,3,4,4,4,5],4,0))

[@ayushkumar2418]

Hey @Memestok, did you managed to write 1:03:10 code in python ?

[@spryzenplays2500]

it's like i am sitting in front of Kunal and he can see my expressions & he is scolding me that why are you not getting these simple concepts😂

[@PriyaSingh-zb5wn]

Thank you for another excellent lecture. It helped me in getting better at recursion .You really know what you are doing.

[@aayushojha3088]

Mann you teach so awesome!!!!!!!, i was able to do the subsequence question by passing arraylist in the argument by my own because i had watched you arraylist video and as you keep on telling make the tree so i did that and was able to solve it , so happy mann!!

[@KunalKushwaha]

Glad I could help!

[@ShivamPandey-jc8rh]

never thought these concepts would be so easy to understand bhai agar yhi videos khi hindi me upload maar diye hote to ajj tabahi ho jati cse field me .

[@animeshrose]

Recursion is a cakewalk now! you have my support till the end of times.

[@KunalKushwaha]

Thank You

[@codeman0017]

yay! just completed the vedio,now I am confident in solving recursion problems

[@imranjamshaid8708]

what a Quality Lectures.I never seen on KZbin

[@thanushkrishna2041]

One of the take aways is how to add a result of child recurrisve call to parent recurssive call and carry it forward adding again and again to a parent call !! New concept.. Liked your presentation, thank you !!

[@dark.violin]

Your explanation is really great and I have so much fun watching your videos. Thank you for making a subject like Recursion understandable and entertaining for me.

[@sharansukesh5542]

Insane teaching man I was able to come up with my own solution in one line for linearsearch return index == arr.length ? false : arr[index] == target || linearSearch(arr, index + 1, target);

[@abhineveash]

The best quality content, thanks Kunal sir..❤

[@shivakumarkonga1532]

Classes are Extremely well......😍😍

[@mayank3411]

A really nice work done by you brother...Really a best video of Recursion...

[@charanteja4619]

Bro simply increasing competition in the Industry!

[@mrrishiraj88]

Good Day! Welcome back! Glad to see n hear you back! 🙏👌👌

[@dineshmadduru7043]

Teaching in such a great way that I feel he's teaching some easy concepts. Thanks guruji

[@sofiyarao815]

guruji MIND IS BLOWN!

[@adilwahla544]

THANK YOU KUNAL for such an amazing content

[@suryaganeshpindiprolu472]

This man is making me fall in love with coding especially recursion

[@SanketPaliwal-z4n]

I wish this series was short, like 10 videos of 10-10 minutes each ❤❤❤.

[@leecha9512]

Awesome explanation and tutorials!!! You made Data Structures, Algorithms, and Recursion dead easy!!!! God bless you beta...

[@poetryiscodingdecoding7965]

One of the finest content of the globe today

[@cb-99-46]

now its getting easier for me to solve recursion problem ... thanks ...

[@siddharthdang1521]

concepts explained so well that I would remember for my lifetime

[@sauravagrawal5013]

Simpler code at 1:03:08 is - static ArrayList findAllIndexWithout(int[] arr, int start, int target){ ArrayList arrlist = new ArrayList(); if(start==arr.length){ return arrlist; } // this will contain answer for that function call only. if(arr[start]==target){ arrlist.add(start); } ArrayList ansFromBelowCalls = findAllIndexWithout(arr, start+1, target); // if current arrlist has no value then return the previous ArrayList returns. if (arrlist.size()==0){ return ansFromBelowCalls; } // if current arrlist is not empty then add all the elements from previous arraylist returns to the current arrlist // and return the arrlist. else{ for(Integer i: ansFromBelowCalls){ arrlist.add(i); } return arrlist; } }

[@SatyaSaiPrasad-ot4jl]

😄

[@twi4458]

November 7, 2021: 101,000 subscribers. Thank you Kunal

[@coder_aditya9567]

Liked the video before watching...coz I know it's amazing ❤️❤️

[@MuhammadAzeem-bd7xf]

Thanks Buddy solved all the questions by myslef

[@Vikkyblogs80]

Best video on the internet , yup it is

[@sagarmore9425]

Kunal is like, this is already covered this topic in the last video please check it out. I am not gonna teach you again. But he tries to teach that topic again, at least in short. :D Kudos to your efforts man.

[@amruthaa5876]

WOWOWOW I understood the basics well now :D

[@sheikhmkrifat7749]

Hats off kunal! take love from Bangladesh!

[@shrirambalaji2915]

Thank you so much Kunal, You made this so simple.

[@meetsoni1938]

The explanation of last question is amazing 🤩🤩💯💯

[@jashhinger442]

See you later byeee, at 58:50 that's was so funny🤣🤣🤣 love the way you teach..❤❤🚀🚀

[@OjasRawat-v6o]

he is really giving his 100 percent ...

[@somyarana8869]

Literally it's amazing 🤯

[@Content_creater_entertainment]

This is what we need

[@satnamsingh3801]

Your courses are the reason I bought KZbin premium😊

[@lucifer.morningstar9523]

1:01:34 Instead of creating list for each call we can return a clone of answer list and before returning we have to clear the answer list

[@Content_creater_entertainment]

Thank you man❤

[@khalidalnhdy9776]

Kunal, you are the best ♥

[@himanshu_1422]

Bhaiya please complete asap these course can't wait for more videos

[@harishs2281]

Yes kunal plz

[@saibrinda8762]

Yes my interviews are on the way 😶this is only hope for coding rounds...thanks for so far🙏

[@prahmodhr3679]

Yes kunal pls finish the bootcamp asap

[@brocklesnar4288]

No kunal bhaiya shouldn't hurry complete it fully

[@iamjayandhan]

Building thought process! Man🔥

[@Naturetheme-i9l]

u are the best in teaching broo that u for this course 😘😘

[@anirudhchakravarty6373]

Between rotated binary search and recursive binary search which approach do we use in an interview? Love this course btw. Would love to see sliding window, 2 pointer, trees and graph questions

[@mohammadaslam6191]

Awesome Explanation 🔥🔥🔥

[@beka3304]

I think it's valid also: static List findAllIndex(int[] arr, int target, int index) { List list = new ArrayList(); if (index == arr.length) { return list; } List belowCalls = findAllIndex(arr, target, index + 1); if (arr[index] == target) { belowCalls.add(index); } return belowCalls; } p.s but reversing indeces

[@immayurpanchal]

Hey Kunal. Watched your Level 1 Questions video on Recursion and was able to solve one interview questions that I was asked in my interview. Unfortunately, I watched the video after the interview. But no worries. Really the way you're solving questions and explaining the thought process is really really beneficial. I also want to tell you that in the video you sometimes tell that it's too easy and doesn't feel like doing it but still you write the code and explain it. Please do that. It seems too easy for you but it's too difficult for people like me who are not that good at recursion. As you've solved those dumb questions and explained them. Hence, I was able to do some other questions also. This is helping me how to think in recursion. You're doing a fantastic job man! Excited to see your DP, Graph, Tree videos. ❤ I'm happy to tell you that you're not like other KZbinrs and share incomplete knowledge. Kudos to your hard work ☮ 😃

[@Videolyy]

Best playlist for recursion🙌..

[@KunalKushwaha]

Thank you

[@foyzanahmed4091]

bro You just drill my brain. You 😍😍😍r a magician

[@poojasharma-cc5ur]

Please please make videos on DP and System Design kunal !

[@ramanjain7284]

Great explanation especially from 52 minutes onwards concept

[@Content_creater_entertainment]

Best ever❤