L7. All Kind of Patterns in Recursion | Print All | Print one | Count
Vložit
- čas přidán 8. 07. 2024
- Check our Website:
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: bit.ly/3wE5aHx
Code "takeuforward" for 15% off at GFG: practice.geeksforgeeks.org/co...
Code "takeuforward" for 20% off on sys-design: get.interviewready.io?_aff=takeuforward
Crypto, I use the Wazirx app: wazirx.com/invite/xexnpc4u
Take 750 rs free Amazon Stock from me: indmoney.onelink.me/RmHC/idje...
Earn 100 rs by making a Grow Account for investing: app.groww.in/v3cO/8hu879t0
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
---------------------------------------------------------------------------------------------------------------------------------------------------- Please check out the entire channel for other sets of series on tougher and complex topics. Also do consider subscribing :)
Please check out the SDE sheet which the entire country is using and getting placed at top-notch companies: takeuforward.org/interviews/s...
Checkout Striver's Handles: linktr.ee/takeUforward
Folks, these are actually very important patterns to keep in mind with respect to recursion. If you understand these then a lot of Binary Tree problems become very simple. I don't think any one else teaches patterns such as these in a separate video.
Great work man!
Notes to Self :-
All possible patters from *Subsequence*
1. Print All the Subsequence
2. Print all Sq which sums to K
3. Print only 1st Sq which sums to K
4. Print the count of Sq which sums to K
*Note In order to understand Printing all subsequence in absolute clear way..... Just take the example which striver gave in previous video
Now create a table of all the output and match it with the power set. A magic will happen and you will be totally blown away 🔥🔥🔥
This man is the sachin ramesh tendulkar of coding.
@@aniksadhukhan8477 Striver ?
I'm so grateful that I found this channel. Whoever is here, may be you found this channel late but don't worry whenever you find this channel your life is gonna take change into a new direction. I'm sooo soooo grateful to have this.
whats the status brother , is it still grateful ? have you learnt dp or left in midway
@@dtu-emgeenear3274 what's your status?
@@dtu-emgeenear3274 what's your status man 😐😐
Thanks is not enough for this GIFT , love you Dada❤️
Mera bas chale to 1M like thok du😍😍
Then GIFT him using youtube "Thanks"
Java code for K sum subsequence :-
void f(int ind ,int a[] ,ArrayList list, int k,int sum){
if(ind==a.length){
if(k==sum){
System.out.println(list);
}
return ;
}
//take
list.add(a[ind]);
sum+=a[ind];
f(ind+1,a,list,k,sum);
list.remove(list.size() - 1);
sum-=a[ind];
f(ind+1,a,list,k,sum);
}
Few lines of adding and subtracting from the sum can be avoided by doing it as part of the function call.
public static void subsequenceSum(int[] nums, int k) {
subsequenceSum(nums, k, 0, new ArrayList(), 0);
}
private static void subsequenceSum(int[] nums, int k, int index, List subsequence, int sum) {
if (index == nums.length) {
if (sum == k) {
System.out.println(subsequence);
}
return;
}
subsequence.add(nums[index]);
subsequenceSum(nums, k, index+1, subsequence, sum + nums[index]);
subsequence.remove(subsequence.size() - 1);
subsequenceSum(nums, k, index+1, subsequence, sum);
}
Here can we also write as
If ( ind==a.length && k== sum)
@@MohanaKrishnaVH yes
@@leetcodebaby6680 is it so?
I am little confused, why we list.remove(list.size() - 1); is used instead of list.remove(a[ind]);
Also why it gives error.
Code for print all: 11:03
Code for print one: 17:17
Code for count: 32:38
👍
Thanks bro 👍🏻
Thanks Bro ! Great for Revision.
does anybody how to optimize the code for count one it's showing time limit exceeded
for printing one I prefer flag wala method its ez T_T may not be optimized but still
Striver always rocks!🔥🔥 In every video, he explains all the concepts in-depth. His teaching style is very unique. He starts from the basics and gradually moves up to advanced levels of questions, yet you never feel like you're solving an advanced-level question. That's the magic of Striver. I never believed that someone could teach such premium content on CZcams for free. Hats off to this man! 💕🔥🙏
Previously, I never understand the concepts of recursion, and here it got fitted into my mind permanently.
Make more videos or playlist on recursion and backtracking. I searched a lot and finally I get your videos. Your explanation is awesome, the way you teach us using dry run is amazing. Thanks a lot dada.❤️❤️🔥🙏
i wish i have found this channel in my second year😓😓
it feels so damn motivated to see striver bhaiya's confidence❤️
kon year me ho bhaii?
Mine too same feel 😪
same bro ..now in middle of 3rd year, hope i got to know about this channel in 2nd year, last year january
me who doing this in first sem feeling proud on myself ,because hardwork never disappoints
@@consistency_Is_key explore bhi karlena first year mai. baaki time bahut hai if rightly use kare toh.
One of the best playlist to understand recursion. Thanks a lot
Another brilliant video! The way you build concepts from the ground up is so helpful and intuitive. Thank you!
Striver your priceless contribution to the coding community will be cherished forever. This content is gold
Before watching this series, I was very poor in recursion. Never understood the concepts in depth. This series helped me to fell in love with recursion. Thanks Striver.
What a way of teaching striver. I am really loving recursion bcz of you🙏
I wanted to send you a heartfelt thank you for your tireless dedication to teaching DSA for free. Your selflessness and passion for helping students with their job interview preparation have made a significant impact on my life and countless others. I am incredibly grateful for the knowledge and confidence you have imparted to us. Thank you for everything you do!❣✨✨
printing only once technique is awesome. like i have tried to do in a contest but got wrong by not applying it in second "if" statement. superb solution sir
nobody teaches me like that!! nobody ever explained me in that much deep.. best wishes my brother and Thank you for making this type of quality tutorial for free.
I used to struggle a lot with recursion while unraveling the code, but thanks to your patient guidance and clear explanations, most of the complexities are clear to me now. I truly appreciate your willingness to help and your ability to break down complex concepts into manageable steps. Your support has been invaluable in my learning journey, and I am grateful for the progress I've made under your mentorship❤
best video on recursion
finally this video gave me confidence in recursion which i never got
One of the most impressive videos of you
Everyone should watch it, whether beginner or experienced
U r the one by which I am comfortable at programming right now
After this, recursion feels like such a beautiful topic
Moving to L8, Learning a lot👍 thanks for the series
Bhai one thing i can say for sure that i watch more than 50 videos on recursion and i dont get much.. But now i got your channel and now i Can do any recursion questions... Thanx bhai for your explanation 🙂
AS ALWAYS U R THE BEST AT EXPLAINING THINGS🔥🔥
UNDERSTOOD............Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
This is indeed the best recursion series ❤️. Thanks bhaiya ❤️
wish I could find this channel earlier. No one had ever explained recursion in such a simple manner. Thank you so much.
hey, striver thanks a lot man for making this series on recursion. I was not able to understand its concept and looking for a solution from last week but when I came across your channel. in just one day I understand the concept and solved 3 problems on leetcode.
Thanks again main thanks you very much. 🙌🙌🙌🙌👏👏
Absolutely Love the way you educate🔥
May god grant you continued success. Thank you for your efforts
What a great video man, all my doubts and concepts of recursion have been cleared, keep up the good work.
Great series so far on recursion.Only thing i will recomment here is to provide a time/space complexity after solving the program.
Best recursion playlist on youtube history
I am amazed as well as curious about how did you learn this on your own ? Great teaching👌
Awesome videos bruh,totally superb.The most clear and understandable playlist ever made.Hats Off "THE STRIVER".Looking forward to more such videos.
Awesome bro. I literally was so dumb before your playlist. Now I am able to think, coorelate pattern and do questions.
Hats off to you. God bless you!!!
Thank you so much Striver for your videos and all your help.
Thank u bhaiya 🙌❤️
For this wonderful series on Recursion ❤️🙌
This is what crystal clear teaching is
Thank You So Much..I really love this explanation..
Hey Striver, Could you also please attach the link of the respective leetcode questions?
@Striver yes, this is much needed
it is always there, since here he is just teaching concepts using his own example so not needed@@sanjoythakur7938
one of the best dsa teachers in the world. thank you Striver for your contribution to computer science education.
All clear now. Thanks bro for creating such amazing videos💥.
Hats off to you man !! May god bless you always 😇
thank you so much for such amazing content and teaching style ki toh baat hi na karo ek dum lit , i'm glad ki mene ye ep dekha , bahut time bachega mera :)💥
Understood all patterns, tysm brother!
Ive never sol ed subsequence problem tried it 1st time and you made it so simple
Would you please show us how to convert a loop in a recursion and vice versa? Also it would be better if you discuss about various types of recursion such as tail recursion etc.
this lecture is like magic. just amazing
In count subsequence problem 23:16 we can take count variable and return count variable everywhere and also in place of l and r use count
Really thankful to this man amazing explanation ❤❤
Recursion was never this easy... thanku raj ❤️❤️
The only person who could make me love and bring interest into recursion
I think there is no need to pass the vector ds as pass by reference in formal argument
why not?
learning to create the tree is very important to understand recurssion!!!
Although videos are shorter but still the explaination and different patterns covers almost everything thanks
Understood and awesome explanations!!
Thanks a lot , great teaching , thank you sir
Amazing concepts here, a must watch.
you are just amazing bro you are a gem to the community
Best backtracking playlist. Thanks a lot.
If i can like this video thousands times I have done that .What an explanation..
Brilliant video, amazing content and explained in the best possible way! Thanks a lot!! Please keep helping us with continued content in the A2Z DSA course. 🖖
Thank you, sir,
for such a great explanation.
Beautifully explained👌
Incredible!! Brilliant Explanation!!! Thanks a lottt!
very well explained... thank you for this amazing course!!
Only one thing i have to say and that is Thank You.
Awesome content...Really helped me. Thankyou bhaiya
You are a legend, I don't know if you're aware how much impact you had on people like me who come from universities and colleges that fail to cover this topic
Thanks Man, Got the doubt clear. Was amazing tutorial
I love your videos 😀 awesome ,very awesome ,helping, Interesting, Entertaining, Full of concept from the depth .thank you bhai . Love you
Striver u are jusssst awesome , the questions which i used to take nearly hours to think , i am able to solve in minutes after watching yr series .❤
No other youtuber is shared...
Thanks for all your super efforts for this wonderful video.
Please, keep posting many such video bayya
Understood evry thing crystal clear
I can see the hard work of your
This is a brilliant video. Thank you!
Sir u r my inspiration 🔥
Thanks for the awesome lecture !
Just🤞🏻🤞🏻🤞🏻🤞🏻🤞🏻 how can i express..... The level of confidence you put in my body
Very insightful, thanks striver for this.
this was beautiful, thanks for this video
Understanding simplified.
Crystal clear , got all the concepts at once💖
Hi
I don't usually comment but this is just beautiful explaination
Super useful, i wish i would have learned this way in my college days ❤
Thankyou Striver, for this great explanation😊
what an explanation ! thank you so much
thank for such simple explanation.
3 patterns with the same problem which can be applied across various recursive solutions (thankyou striver 😊)
ur explanation is best bhaiya in this entire youtubee.... thanksss alottttttttttttttttttttttttttttttttttttt .. god bless uu ..
u explain very well thanks for the videos.
bhai dilse sukriya akpa...bhagwan apko hardam khush rakhe
u r the best sir thanks a lot
This is just THE BEST.
I don't have anything to add.
Most fascinating thing about this it’s almost identical to a backtracking algorithm, where you have to conduct an exhaustive search to your base case/goal
Not just a human, you're a brand that everyone would move to before anything else :-)
Great 👍 ,you are best as always