Тёмный

Subsets | Simple Story To Code | Leetcode 78 | Recursion Concepts And Questions | Video 17 

codestorywithMIK
Подписаться 66 тыс.
Просмотров 8 тыс.
50% 1

Опубликовано:

 

18 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 37   
@oqant0424
@oqant0424 Месяц назад
Did it on my own 🥳 all because of your past teachings Thank u so much💖
@bhuppidhamii
@bhuppidhamii 4 месяца назад
came here to learn about subsets
@Dezy_Kri
@Dezy_Kri 4 месяца назад
solved today problem of the day!
@codestorywithMIK
@codestorywithMIK 4 месяца назад
Awesome 👍🏻
@shreshth1961
@shreshth1961 Месяц назад
@@codestorywithMIK sir subset with duplicates vala ki video bna di jiye plz
@wearevacationuncoverers
@wearevacationuncoverers 7 месяцев назад
Thank you so much mik. I wanted to let you know, me and my friends are learning from your playlists and we play it on speaker and everyone sits and listen and make notes. Thank you so much again for doing so much for us.
@g.b.kevinarjun6819
@g.b.kevinarjun6819 Месяц назад
bro ur explanation is the best
@kapilrules
@kapilrules Месяц назад
bhai tera lakh lakha dhanywaad 13:49 pai jo chij thi vohi samazne ki kab se koshish kar raha tha
@Ankitkumar-hu8kp
@Ankitkumar-hu8kp 8 дней назад
class Solution { public: vector subsets(vector& nums) { int n=nums.size(); vectorv; int subsetsum=1
@Momentsofmagic28
@Momentsofmagic28 7 месяцев назад
Your consistency is on another level.
@technicalguy.
@technicalguy. 4 месяца назад
Exceptional Teaching ❤❤
@codestorywithMIK
@codestorywithMIK 4 месяца назад
❤️🙏
@yashkalia2311
@yashkalia2311 4 месяца назад
Never stopppp working sir❤❤❤we are greatfull to have you
@helloimjavauser
@helloimjavauser 7 месяцев назад
Additionally, I enjoy watching your videos. They provide really good explanations. Thanks a lot for your efforts.
@8daudio672
@8daudio672 3 месяца назад
Best thing i Got this year❤
@ru45098
@ru45098 7 месяцев назад
i request you to complete the series ,dont put this on hold or stop the series. Amazing video as always
@souravjoshi2293
@souravjoshi2293 7 месяцев назад
yes please
@indian_tech6185
@indian_tech6185 2 месяца назад
sir ek code ka dry run bhi kraa dete to or achay say smjh aata..btw thank you 💯👍
@codestorywithMIK
@codestorywithMIK 2 месяца назад
Hi there. Feedback taken . I will take care of this thing in mind for future videos ❤️🙏
@a3rdtierguy864
@a3rdtierguy864 4 месяца назад
Similar aayega to ek set bna lenge aur last me phir set ko vector me convert kar do that is the approach
@rode_atharva
@rode_atharva 2 дня назад
//ye bhi ho gaya khudse beacause of you class Solution { public: void backtrack(int idx, int n, vector& temp, vector& ans, vector& nums){ if(idx >= n){ return; } temp.push_back(nums[idx]); ans.push_back(temp); backtrack(idx+1, n, temp, ans, nums); temp.pop_back(); backtrack(idx+1, n, temp, ans, nums); } vector subsets(vector& nums) { int n = nums.size(); vector ans; vector temp; ans.push_back(temp); backtrack(0, n, temp, ans, nums); return ans; } };
@tosifkankod1300
@tosifkankod1300 2 месяца назад
bro keep making video like this
@jahanvikumari7215
@jahanvikumari7215 2 месяца назад
upload the video for duplicate elements also sir helpful for us
@gauravbanerjee2898
@gauravbanerjee2898 4 месяца назад
Thanks a lot bhaiya ❤❤
@Virtualexist
@Virtualexist Месяц назад
How to do this with for loop method?
@GauravSingh-xx1bs
@GauravSingh-xx1bs 4 месяца назад
maza aagya yrr
@layathal7460
@layathal7460 3 месяца назад
Sir, why here temp.pop_back() is not given after the second recursive call? but given in 'generate paranthesis' question? When I removed the second pop back from generate paranthesis qn , it is not working. what is the difference between these two?
@jeethora586
@jeethora586 3 месяца назад
What you did for not selecting a duplicate subset ? I m confused
@abhaygupta6221
@abhaygupta6221 7 месяцев назад
Sir please make of today's GFG potd
@codestorywithMIK
@codestorywithMIK 7 месяцев назад
Take hint from this video. It will help to build the intuition for that also Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489 ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-gDPh7gsK3F8.html Let me know if that helps
@Area-fd8ht
@Area-fd8ht 7 месяцев назад
Bhaiya @@codestorywithMIKpermutation 2 (leetcode 47) me bhi add kar do es series me pls🙏🏻🙏🏻🙏🏻
@dayashankarlakhotia4943
@dayashankarlakhotia4943 7 месяцев назад
one error temp.add(nums[i]);
@pavankalyan9083
@pavankalyan9083 5 месяцев назад
I m here to watch your videos but disappointed because language is Hindi😢
@codestorywithMIK
@codestorywithMIK 5 месяцев назад
Apologies for the inconvenience 🥺☹️
@dayashankarlakhotia4943
@dayashankarlakhotia4943 7 месяцев назад
code for duplicate. public Listsubset WithDup(int[]nums){ Listans=new ArrayList(); Arrays.sort(nums); backtrack(0,ans,new ArrayList(),nums); return ans; } private void backtrack(int idx,Listans,Listtemp,int[]nums){ ans.add(new ArrayList(temp)); for(int i=idx;i0&&nums[i]==nums[i-1]) continue; backtrack(i+1,ans,temp,nums); temp.remove(temp.size()-1); } } 🎉❤
Далее
L11. Subset Sum II | Leetcode | Recursion
30:16
Просмотров 320 тыс.
Bike Vs Tricycle Fast Challenge
00:43
Просмотров 12 млн
Print unique subsets And Variations
24:48
Просмотров 106 тыс.
Recursion in Programming - Full Course
1:51:36
Просмотров 948 тыс.