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

@teslatestingwala5019

2 жыл бұрын

He gets Powerfull blessings

@jayakumar9976

2 жыл бұрын

i can personal vouch for it!!..

@logeesh2009

2 жыл бұрын

Agreed

@er.albertaddy2386

2 жыл бұрын

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.

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."😂

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

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

2 жыл бұрын

Glad to hear that!

@ankitpani6656

2 жыл бұрын

From Which College Are You?

@omkarjoshi7371

2 жыл бұрын

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

@mycomputer1429

2 жыл бұрын

Your linked name please

@mycomputer1429

2 жыл бұрын

Links

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

@sreejak6776

2 жыл бұрын

Yes! I agree

@studyafa7159

10 ай бұрын

Nhi hoga. 🧹🧹

@demonking7900

10 ай бұрын

​@@studyafa7159why not

@_DashingAdi_

9 ай бұрын

​@@studyafa7159lul

@roshanchauhan1123

7 ай бұрын

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

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

2 жыл бұрын

Glad I could help

@Kondlapudi

2 жыл бұрын

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

9 ай бұрын

@@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.

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

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?

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

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

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

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

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..!!!

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

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

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

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

*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

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

2 жыл бұрын

Thanks a ton

concepts explained so well that I would remember for my lifetime

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

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

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

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

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

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

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

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

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

what a Quality Lectures.I never seen on KZread

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); }

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!!

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

@KunalKushwaha

2 жыл бұрын

told ya

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

guruji MIND IS BLOWN!

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

25 күн бұрын

striver's playlist is complete unlike his

@Virtualexist

25 күн бұрын

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

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.

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

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);

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

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

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

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

The explanation of last question is amazing 🤩🤩💯💯

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

@user-om7vk9gk5k

Жыл бұрын

bro not many all

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

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

@harishs2281

2 жыл бұрын

Yes kunal plz

@saibrinda8762

2 жыл бұрын

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

@prahmodhr3679

2 жыл бұрын

Yes kunal pls finish the bootcamp asap

@brocklesnar4288

2 жыл бұрын

No kunal bhaiya shouldn't hurry complete it fully

these playlist of recursion deserve million of views

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.

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

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 !!

in the Q 01, sometimes there will be cases where index and index + 1 will have the same value. for that case make sure to use this arr[index] arr[i + 1]){ return false; } } return true; } // using recursion public static boolean isSortedRecursion(int[] arr, int index){ if (arr.length - 1 == index) { return true; } return arr[index]

WOWOWOW I understood the basics well now :D

THANK YOU KUNAL for such an amazing content

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

20 күн бұрын

😄

One of the finest content of the globe today

amazing content Kunal, thank you. Waiting for season two :)

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

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 KZreadrs and share incomplete knowledge. Kudos to your hard work ☮ 😃

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

@KunalKushwaha

2 жыл бұрын

Thank You

Love your teaching ❤️

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

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

A big thanks Kunal..for qauality content and with nice explaination

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 ❤

best best best especially i was confused at the begining that how the list is geeting returned empty but now its clearer than ever thank you sir 1:02:00.

Thanks kunal❤😎💯

This is GOLD❤

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 ?

Great Video. Highly recommended!.

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.

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

you make my day man, thanks 🙏

Debugging makes learning easier . Thanks for the tips .

Thanks for the great explanation Kunal..

best explanation ever

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

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

2 жыл бұрын

Glad I could help!

Bro simply increasing competition in the Industry!

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

Kunal, you are the best ♥

Thanku kunal sir

brilliant concept explained in detail.🤖

thanks a lot, no words to describe.

Really loved the video 😍

Hats off kunal! take love from Bangladesh!

Super explaination about array lists in recursion

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 .

great tutorials man! Thanks a lot

Your courses are the reason I bought KZread premium😊

GREAT EXPLANATION

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

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

Great explanation especially from 52 minutes onwards concept

Can I do a one time payment (instead of monthly subscription)? Brilliant videos...absolutely loving them. I think what's amazing about them is the way the skills are being built up incrementally (like progressive overload for gaining muscle) -this is the key to mastering any skill/subject :)

Hats off to u bhsi gem content

Intersting explaining, thank you.

Do the OOP video ASAP. Because lots of courses do the oop in early part of the course.

you are the best bro

THANK YOU SIR !