Decoding Recursion | Count Ways to Reach Nth Stair Problem! | Nishant Chahar | Leetcode | GFG
Вставка
- Опубліковано 12 вер 2024
- In this video, we are learning about Recursion and how it works with the help of two problems.
1. Problem: practice.geeks...
You can use my code NISHANT to get 10% Off on all GFG courses.
✨ Important Links ✨
- Don't Click Here: bit.ly/3afmPha
- Telegram Link: t.me/codeIn10b...
- Github Repo Link: github.com/cha...
✨ Hashtags ✨
#NishantChahar #Microsoft #DSA #Recursion #FAANG #NSIT #NSUT #engineering #internship #college
✨tags ✨
Where to learn dp
where to learn graphs
where to learn dsa
how to start programming
how to start coding
where to learn trees
what is memoisation
what is tabulation
what are graphs
where to learn Operating systems
where to learn dbms
where to learn oops
where to learn computer networks
where to learn low level design
where to learn cs fundamentals
Sanchit jain
Gaurav sen
Gate smashers
Placement guide
How to start programming
where to learn cpp
where to learn python
where to learn javascript
where to learn java
Placement guide
Nishant Chahar Placement Guide
languages to learn
resources to learn data structures
Projects development
AR/VR
Blockchain Machine learning
Deep Learning
Software developer engineer ,
Side projects ,
Importance of side projects ,
Machine Learning Engineer,
How to become a machine learning engineer ,
Associate engineer
Data structures Algorithms
College Life, College, Memories
Fun Fests Chill Enjoy
IITD Mood indigo rendezvous IIT
NSUT Moksha DTU Engifest
Bits Bitsgoa
Namaste Javascript
Namaste Javascript Akshay Saini
Apna college
Apna college c++
apna college DSA
Where to learn dp
where to learn graphs
where to learn dsa
how to start programming
how to start coding
where to learn trees
what is memoisation
what is tabulation
what are graphs
where to learn programming
how to start coding
where to learn coding
where to learn DSA
resources to learn programming
how to crack amazon
how to crack placement
blockchain
what is blockchain
blockchain technology
blockchain technology explained
blockchain explained
blockchain technology in hindi
web development roadmap
roadmap to learn web development
android development roadmap
MERN stack roadmap
machine learning roadmap
roadmap to learn machine learning
roadmap for deep learning
roadmap for 2nd years
roadmap for opensource
roadmap for ios development
roadmap for deep learning
roadmap to learn DSA
I hope samajh raha hoga! kuch bhi suggestions ho to bata sakte ho
Also TLE isliye aa raha hai because ye sab problems Dynamic Programming (DP) ki hai vo jab karnege to hatt jayega ye don’t worry!
link: practice.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair-1587115620/1
Bhaiya mujhe smjh mai aa raha hai maine notes v bana raha hun 💓 lot of love and thank you very much bhaiya
Better understanding with you bhaiya
So smooth bhaiya 🤭🤭.. achesee samj agaya💕💕.... Nishant Bhai I'm 3rd year CSE student, Microsoft is my Dream company #Microsoft
jab mene yhan submit kiya to mera code 21th test case par jakar code optimazation ke liye bol rha hai so what i do
my code is :
int countWays(int n)
{
if(n==2 || n==1)return n;
long long int recall1 = countWays(n-1);
long long int recall2 = countWays(n-2);
long long int res = recall1+recall2;
return res;
}
Yessss..... Bhaiya
Day-3
thanks for such an amazing video bhaiya............. :)
Day 3 Task Done ✅ and Waiting for Tomorrow Lecture. Now i understand Recursion Concept.
Bhaiya your explanation is to the point which is different from other UA-cam channel 🙂👍👍
Thank you !, Nishant Bhai❤️ for making this course in HINDI🤘🤘.
Day3 : ✅
Nicely explained...that connect to the stairs' example
You are awesome 🔥
the explanation was very clear , thanks bhaiya ❤️
Amazing feeling learning with you :) thank uh bhaiyaaa
one of the best explanation on youtube
Am a beginner wow he's good at teaching ,
My journey starts from here!
Day-3 out of 30
Thank you bro
Same as previous question it's showing the time limit exceeded error and it only passed 21 cases over 997.
I know this is the way to get answer but i think it's not so optimized.
Edited - Ok I saw your pinned comment now i got this. 👍
Completed 3rd video , thankyou Nishant bhayia
Excited for more learning with you....
Crystal Clear understanding of recursion concept very well explained bhaiyaa❤🔥
very helpful,
great explanation
Thanks nishant bro it is very helpful to revise my recursion and also easy to understand thanx for this and itta hardwork krne k liye humare liye.....
your hardwork payss off.....
--> Great great bhaiya..
--> small small things u covered with easiest examples..
--> keep growing..
day 3 done successfully! I was able to code this question myself! Good improvement! feeling motivated!
Recursion is crystal clearly explained by you nishanth brother.... Thank you so much for having a little glimpse of last 2 classes in today's class bcz it made us to take to the concept so much brother....
Thanks a lot and the trick of base case, small calculation, recursive call and it is very clear brother....
Day 3/Day 30 is successfully completed bro
Excited for tomorrow's session brother
I understand the concept of Decoding recursion and the solved example Nth stair problem, Thank you @Nishant Sir very much.
Extremely simplified manner of teaching
Luv Bhaiya se Padhne ke baad, ab yaha aake knowledge or polish ho gayi. THANKS.
EKDUM NEXT LEVEL BHAIYA............BAHUT MST PADHAYA HAI
Amazing Content and Amazing Concept of Teaching..... Thankyou So Much Bhaiya 💓 💖 for this....very Helpful and easy to understand 👉🏼👉
Day 3/50
Now I understood it properly
Thanks
Understood the concept behind this problem...will code it.
Getting everyone that come every day to learn here
day3 done , I was confused on how to solve this type of problem, great explanation, thanks
Day 3 New day with new problem 👍
now it looks simple to solve thnks for this ✌️
I have already studied the use of recursion but I like the way you teach us keep doing.
Good explanation and good example used. But please sir try to take different varieties of questions also. Overall great work ❤️❤️
Ha bhaiya samajh aa gya
Yeh que apne bohat easy way main samjhaya h
now recursion is getting more easier and I have a request can u make a video on c++ stl
Video -3 completed
#code in 10
Like your explanation technique alot.
Day 3/30
Thank you so much Bhaiya 🔥🔥 , bahut sandar
Day 3 done👍... Yo toh badhiya que se... Keep going bhaiya
Day 3/30
Understand concept thoroughly
Solved problem!
Thank you so much for this series!
I really like your way of explanation.
3 Days completed .
GOAT Nishant bhiya ❤❤
waiting for next lecture👀👀
Day 3/30
Three days completed!!
Waiting for next videos!! 🤩🤩
Day 3 Completed Successfully
I am waiting for next video , thanks bahiya for amazing videos
Thanks bhaiya, although I am trying to understand this problem but you make the understanding for me even more easier.
I was trying to solve this problem but was not able to, thank you for this solution, it was really helpful :)
Day -3.
Pehle theory se concepts clear then coding se application. Easy and amazing. Thanks
Day 3 - Finally grasping the concept of Recursion. Great video.
Thanks for taking that n = 4 example that made me clear how recursion works in this question
Sir really your voice is amazing your face expressions latterly looking good
Great work ... Learning Daily😇😇
You are teaching so well that I solved the question before you solved in video
Day3- So much helpful....
You are not only a good vlogger but also a good teacher....
Thanks a lot..... Bhaiya❤
Amazing Content and Amazing Concept of Teaching..... Thankyou So Much Bhaiya
thanks bhaiya recursion in 10mins is fun and amazing
3/30 done😌... Eise chalta raha toh pata nahi chalega kab 30 days khtm ho jayenge aur humara DSA v ho jayega💯... Thank you for making us understand gfg questions.🧿✨
Video on time Buddy 😇
Day 3 ✅
Loving the way I'm learning from you ❤️
Day 3 done and dusted. Waiting for tomorrow's video to learn more advance problems of recursion
Day 3 ✅
I didn't studied recursion earlier .
You explained nth stairs problem very well and in simple manner 🤗
Getting motivated to learn more in this series 👍
Wow what a simple clear explanation man!!
Thank you so much bhaiya. All clear👍🏼
I am now getting good grip on recursion sir 😀
Loved this vid and got the concept 🥂
Started understanding questions ✨thanks
Loving the Recursion Series!
Great approach 3 video done 〰️❤
Love from assam nishat bhaiya ❤
Now it's my 3 lecture and i enjoy this lot's of respect for you bhaiya
And i also jumpe 2 stairs 😂
Great Content!!!!
Bhaiya ek suggestion h, aap apni video right side me krdo.... jb code run krke dikhate ho toh wo aapke peechhe chhup jaata h!!
Day - 3 ✅
Wonderful explanation 👌❤️
Day 3/30
Done bt it was late as am not aware of it thank you for solving this question!
Fully Clear after.............
Thank You bhaiya ♥
Day 3, I just gained some confidence in doing programming . Thank you so much bahiya 😊😊
Day 3 Task Done bro getting a nice hand of recursion now
Nice
I like your videos
Another day another video. Done!!
you are very nice at explaining bhaiya I am able to think now
Task 3 done ✔
Thank you so much for all your efforts bhaiya❣
Bhiya Please System design zarur padhha dena apne Channel par its help for our placements and internship
Bhai doing a great job you are helping alot keep it upp soon i will meet you at microsoft !!!!!!
Day 3 done sir like your content ❤️
I need this type lec to thank you sir
Day 3:Done....very nice explanation bhaiya...
Eagerly waiting for next episode 😍
starting me thoda difficult lag raha tha but Code dekhke simple laga
Day -3 out of 30✅️
Love to see such content on UA-cam ♥️
Day 3 completed... Absolutely loving it! 🙂
Day 3 wow,learning together bro 😀
DAY 3 done....awsm explanation bhaiya.
I am waiting for my 12 board result, then I go to my college but, before I know the Recursion topic, Thanks Nishat bhaiya for the day 3 out of 30 days
And and and....... I am coming..........................!
Very nicely explained bro 🥰
Wow,Easily solved ...Thanks Nishant bhai..
DAY-3/30 done
Very well explained bhaiya
Day 3/30
Learning with you is just feels Amazing 😌♥️
Day 3🔥 : 🌟Happiness is not found in palaces , it is found in 😊compilers✅ in making hands dirty with code❣
Day 3✅
You are making recursion look simple by giving great examples..
bhot ache se samjh gye bhaiya thank you very much
Day 3/30 💯 Task Done.. 👍🏻
Great Session
Day 3 Done ✅. Concept cleared👍🏻
Day 3- Done and Dusted. Started getting little bit of confidence, feeling good , credit goes to you❤. Thank you. #Codein10
Was traveling from last 2 days but will do day 3 and day 4 homework now
3/30 Day , good explanation bhaiya. explanation is very clear.Thank you so much bhaiya.
Day 3 done ☑️. Waiting for the next lecture.
Consistency maintained 📈