I am 3 ⭐ codechef coder and practice continuesly ...when I got this tutorial I enhance myself and get the edge to my FAANG JOURNEY ,, thanks a lot for the Great fundamental for coding Thans luvv bhai.......
after watching 12 videos of the same topic i came across your one and you made this question so easy to understand. please bring a question solving series on DSA, you explain so well
Thank You Luv, for this problem I tried to find some solution and watched so many videos and code but finally, your explanation helped me to understand the problem and concept. Thanks a lot
I was struggling a lot with backtracking, but now I developed a general method which is able to solve maximum of the backtracking problem, Thanks a lot
This course is helping me a lot. Thank you so much for making these videos! The only thing I wanted to ask is if we can get the solution videos for the Questions given in the description box, it would be really helpful.
boss, your teaching technique so much amazing brother.If you come in Bangladesh any time just inform, we welcome you as a VIP guest, I respect you deepest corner in my hart
Nice explanation! can you please provide one example where we use loop inside the recursion code? it becomes difficult to visualize the flow when loop is used inside the recursion code. I would like to hear your though process while handling loop inside the recursion.
But you are not printing all subsets!? Subsets may not be contigious and may not be in order. Lets take an array 123 in this 321 is also a subset which is not coming in case of your code.
i generally use bitmasking.. recursion has slightly lesser time complexity though but there is factor of n difference in both time complexity which doesn’t matters as overall time complexity exponential
Hi Luv, I have a doubt. I was trying the same question with first let's include, then not include, unlike u did. But I am not able to make it work. Getting segmentaion fault. Any idea?
Luv bro can u even make a video for beginners on how to use codeforces or codechef efficiently and how to proceed if one has just started on these websites please ✌️✌️❤️❤️
there is nothing much to make, just go solve questions and give contests, currently i am focusing on my course hence these type of video wont be possible
Hi Brother, I love your all video. Keep it up. Could please provide me solution for below problem. Make a valid equations like that must be having left side and right side equal. Input: 2 2 3 7 5 (N) Output: 2 + 2 *3 = 7*5 (left hand side right hand side equal ) You can use below operator to make equation. Constraints: 1
bhaiya backtracking ka question he ye pta kese lagega mtlv ye to kaafi similar he recursion se to koi idea yaa fir vhi questions krne pdengy bhut saare tbhi idea lagega?
yaar bro ye aap jab locally code likhte ho and then leetcode pe likh rhe ho pls mention the differences kuch samjh nahi raha waha leetcode pe kya kr rhe ho! matlab class hai na waha badme leetcode pe extra code kya and kyu likha kuch palle nai pada? pls explain that
bhai order me jayenge, ye course is going to help future people also, so mai jald baazi nhi krunga and proper order me sab detail me cover krunga.. dp me abhi time lagega
I came up with slightly different arrangement: void backtracker(int i, vector& nums){ if(i >= nums.size()){ return; } temp.push_back(nums[i]); superSet.push_back(temp); backtracker(i+1,nums); temp.pop_back(); backtracker(i+1,nums); }
![Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]](http://i.ytimg.com/vi/V0IgCltYgg4/mqdefault.jpg)
![Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]](/img/tr.png)
Bloopers dekh kar samaj aata hai ki video content banana kitna mushkil hota hai and kitne efforts lagte hai vo final perfect cut laane me. Respect 🙏
exactly very true
I am 3 ⭐ codechef coder and practice continuesly ...when I got this tutorial I enhance myself and get the edge to my FAANG JOURNEY ,, thanks a lot for the
Great fundamental for coding
Thans luvv bhai.......
m bhi 3 star hu
Where are you now?
@@aethistt Now, he is married and has a son named MAANG..
@@YeaOhYeahh 😱😱😱😱😱😱😱😱😱😱😱😱😱😱
@@shriganeshayenamah3422 😂
Love u Bhai, Gadar Explanation Diya yrr , 100 videos dekh chuka hu backtracking pe, Kabhi clear nahi Hua tha , ab hogya .
Bloopers were hilarious... Shows how much efforts it requires ☺️ you are amazing and underrated 😁
Bhai, I mean it when i say you are the best tutor on youtube. Haven't really come across a better explanation on backtracking till date. Mad respect
you are doing great work for the community man!!!
Today alone i watched 5 different question related topics sir.The way you explain things is super clear.thankyou
Very transparently explained. Got a lot of values from it. Thank you so much!!!
after watching 12 videos of the same topic i came across your one and you made this question so easy to understand. please bring a question solving series on DSA, you explain so well
Your Bloopers shows the dedication and hardwork behind making one video
finally, I got this understood 100%!!!
Thank you, sir.
You are filling more and more interest in this journey of competitive programming. Thank You 😇
What a great explanation, for me it took 2hrs+ time to understood but it is very clear now, thank you so much..
Best explanation of this problem on youtube.
Thank You Luv, for this problem I tried to find some solution and watched so many videos and code but finally, your explanation helped me to understand the problem and concept. Thanks a lot
Broo, thank you so much for making this video so clear. I tried multiple videos and explanations before but wasn't able to understand any. Great work
I was struggling a lot with backtracking, but now I developed a general method which is able to solve maximum of the backtracking problem, Thanks a lot
from whom did u study on youtube?
Bhaia maine last video dekhi thi, or ye wala khud s solve kia. Super happy to verify and watch my approach being developed.
Very nice explanation! Best video for subset problem, thankyou so much!
The only good explanation I could find, thank you!
kaafi time se samajh ni aa raha tha ye concept, now I got it.
This course is helping me a lot. Thank you so much for making these videos!
The only thing I wanted to ask is if we can get the solution videos for the Questions given in the description box, it would be really helpful.
Yet another amazing video!
Bhaii Love u kya padaya hai Wahh!!! Wah!!!
Ye sb question bhott rulaye the....thnks luv bro
Thankyou so much for making such content bhaiya 💛💛💛💛💛💛💛💛
As a creator i relate it 1000%.
Thank you so much luv bhaiya for taking this much efforts for us luv you bhaiya 💓
Luv sir.... Any possiblity of making videos on technical interview preparation questions from your side ?
not right now, i had made some interview exp in past, you canc heck them right now i am trying to focus more on the course
@@iamluv bro yadi hame fix length ke subset banane h jaise array 10 size ka h or 5 size ke subset banane h to wo kaise krnege
Bro u explained very well ❤❤❤❤
boss, your teaching technique so much amazing brother.If you come in Bangladesh any time just inform, we welcome you as a VIP guest, I respect you deepest corner in my hart
Explained beautifully 😍😍
bhaiyaa..... gajab smjhate ho aap
bole to faad dalte ho
thank you sir ..... very much
nice explanation yr..came here after watching striver's video..since I was confused on why do u pop out the element
The way you said "LE LETA HOO" was very funny !!!!
*I didn't understand the base condition. Why it's not if (nums.size() == 0) if all the elements are consumed!*
Because, the largest subset contains nums.size() no of values, so that's why he had taken i==nums.size()
Thank you😊
ماشاء اللہ 💞
Wonderful explanation sir. Thank you so much.
Nice explanation! can you please provide one example where we use loop inside the recursion code? it becomes difficult to visualize the flow when loop is used inside the recursion code. I would like to hear your though process while handling loop inside the recursion.
Bloopers says how much efforts should you made in videos 🔥
Great explanation
Bro which tablet did you use?
Thanks Luv
luv bhai what is the time complexity of this solution using recursion and backtracking
🔥🔥🔥owsum
U R GREAT,MAN
This same code is not working in python can anyone explain it please ,I am so frustrated
Thank you so much 😭😭
bro , please explain about how permutation code work ?
I wrote the same code and in the end of each subset it is showing a 0. What do I do ?
if i not write backtracking statement code will perfectly work why?
Thanks a lot
But you are not printing all subsets!?
Subsets may not be contigious and may not be in order.
Lets take an array 123 in this 321 is also a subset which is not coming in case of your code.
What is time complexity of this code?
Ur solution is giving TLE in some tests in coding ninjas platform.
i am not getting it how we taking care of subset's uniqueness
Good video
Luv bhai, which method is better for generating subsets?
bitmasking or recursion??
i generally use bitmasking.. recursion has slightly lesser time complexity though but there is factor of n difference in both time complexity which doesn’t matters as overall time complexity exponential
Time Complexity ?
its exponential, i will make a seperate video discussing these things, i forgot to mention time complexity
@@iamluv Ty sir
Hi Luv, I have a doubt. I was trying the same question with first let's include, then not include, unlike u did. But I am not able to make it work. Getting segmentaion fault. Any idea?
made it work. Thanks for the concept.
Luv bro can u even make a video for beginners on how to use codeforces or codechef efficiently and how to proceed if one has just started on these websites please ✌️✌️❤️❤️
there is nothing much to make, just go solve questions and give contests, currently i am focusing on my course hence these type of video wont be possible
@@iamluv can u tell about a2oj ladder should I follow that ??
yeah you can its good
can you please tell me how to formet code in vscode or any online code editor ?
use google brother
@@iamluv sure brother ❤️
💛💛💛💛
Time complexity?
Rather than passing by reference (subset) if you copy than no need of pop_back()
it will lead to stack overflow as in each recursion a new copy will be created.
If yeh python mein karna ho toh kaise karenge?
Bhaiya recursion tree bnana sikha do ...
Ur solution wont work for unique subsets , it will insert duplicate subsets in the 2d vector.
Hi Brother, I love your all video. Keep it up.
Could please provide me solution for below problem.
Make a valid equations like that must be having left side and right side equal.
Input: 2 2 3 7 5 (N)
Output: 2 + 2 *3 = 7*5 (left hand side right hand side equal )
You can use below operator to make equation.
Constraints: 1
Next "number theory" bhaiya
AFter binary search.. binary search kaafi important hai
bhaiya backtracking ka question he ye pta kese lagega mtlv ye to kaafi similar he recursion se to koi idea yaa fir vhi questions krne pdengy bhut saare tbhi idea lagega?
backtracking as such kuch hota nhi hai, bas recursion hi hai dont think it as different, its all recursion just keep solving questions.
I think it is called subsequences
bro code toh bina pop back k bhi accept ho rha h please explain!
You wouldn't have passed it by reference ig
@@valobhediya hn bhai m bhi smjh gya tha bus thoda search karna pda tha, btw thank you
u are calling generate in generate. so shouldnt it be infinite loop
Function calling itself called recursion
What is difference between subset and subsequence????
its same only
subsequence contain elements whose subscripts are increasing in the original sequence. ...subset contain any possible combinations of original set.
@@aravkhandelwal7043 yout ake any subsequence you can call it a subset you take any subset, you can order it and call it a subsequence.
yaar bro ye aap jab locally code likhte ho and then leetcode pe likh rhe ho pls mention the differences kuch samjh nahi raha waha leetcode pe kya kr rhe ho! matlab class hai na waha badme leetcode pe extra code kya and kyu likha kuch palle nai pada? pls explain that
Kabhi Leetcode pe question solve kiye hain?🤓
Best
fan from andhra
Sir, plz tell about time complexity of this recursion.
posting the video soon
♥️♥️
💯💯💯💯🙇♂️🙇♂️🙇♂️🔥
Sorry bhaiya par yeh subset generation nhi subsequence generation hai.
the best part is blooper
This can be done with bitmask also right?
yes
❤️
Why don't we do backtracking in subset generation of a string, that also works in the same way naah!
Stack calls ke through karna bhai please
First
Big fan Bhaiya
wrong codee since it is not taking care of duplicates
bhi please dynamic programming start kar de
btw Big Fan
bhai order me jayenge, ye course is going to help future people also, so mai jald baazi nhi krunga and proper order me sab detail me cover krunga.. dp me abhi time lagega
Just a comment to increase reach.
😆❤
there is an invention called english
Bloopers 🤣🤣🤣🤣
Ohh bhai ek doubt tha
you can ask in discord
@@iamluv time complexity kay ho gi
?
I came up with slightly different arrangement:
void backtracker(int i, vector& nums){
if(i >= nums.size()){
return;
}
temp.push_back(nums[i]);
superSet.push_back(temp);
backtracker(i+1,nums);
temp.pop_back();
backtracker(i+1,nums);
}
Reach++;
First comment