Power Set | Print all Subsequences

[@bhargavnagacharan1899]

If I would have seen this video teo ayd earlier I would have been placed now 😭😭😭. Anyway thanks bro ❤️

[@prakashmuthyala495]

In Which company?

[@tanayshah275]

Heads up: if anyone is visiting the problem link for practicing at GFG make sure you sort the resultant array and also remove the empty string before submitting the code. Great Video Raj, Really enjoying the frequency at which the Videos are coming from last week. Thanks for all your time and efforts.

[@ankitasinha9912]

AllPossibleStrings(s){ //code here s=s.trim() let n =s.length; let ar=[] for(let num=0;num

[@yegavintisumanth5593]

tq

[@stith_pragya]

Understood......Thank You So Much for this wonderful video.....🙏🏻🙏🏻🙏🏻

[@gurjotsingh7817]

Sir thank you so much for sharing these amazing explanations with us. 🔥❤

[@mohdfarhanahmed9416]

Striver, can you tell us from where you will get the intuition of the problems? Fully understood! Keep up the outstanding work.☺️

[@takeUforward]

These are more observation based problems, questions like rainwater trapping and next permutations have intuition..

[@tirumanadhamaishwarya1320]

Thanks sir you are literally provided most valuable content and these are really helpful!!:)

[@shrijonbiswas8105]

I hope you are doing EXTREMELY WELL!!!

[@abhay9994]

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

[@neetisaharan1340]

thank you so much for sharing these amazing explanations with us.

[@tanayshah275]

Recursive way for writing the code : def findall(s, i, cur, res): res.append(cur) for idx in range(i, len(s)): findall(s, idx + 1, cur + s[idx], res) s = 'abc' findall(s, 0, "", res) Posting so others can also think of one more approach to solve this problem

[@takeUforward]

Yes, explained this in recursion playlist..

[@AnkitRaj-ux7lv]

// this is best intuition expected by any company class Solution { public: vector subsets(vector& nums) { int n=nums.size(); vector ans; for(int i=0;i

[@shubhammishra1225]

How can we think about these types of non typical approaches ...

[@vasujain1970]

Thank you for the amazing and helpful videos!

[@sushmitamandal1677]

Thank you sir i finally understand from your explanation searching for 2 hr😊.

[@jugantarchakraborty9216]

Bhaiya is an inspiration for T3 college students

[@subarnarekhaghosal4447]

Thanks for the videos. one doubt, 6th index should be cb right why bc?

[@sayak]

in striver SDE sheet, this question is under Trie category. Why? I couldn't do it using Trie. getting stuck in cases like "aa". Didn't find any solution that uses trie for this question

[@ADNANAHMED-eo5xx]

Thanks Striver 79 for uploading videos so frequently.

[@meghamalviya8495]

Understood. Thankyou for these videos!

[@arunpandey1487]

Bhaiya in MSB in O(1) can't we just return (1

[@AngadSingh97]

Thank you Striver, understood

[@manaskhare412]

Till now, best explanation !!

[@neerajkashyap01]

Got to know about Power set

[@amanali9501]

If we do 110 & 000 it will give 0 means 0 index is not included in it , which is not true

[@0x978]

Genius non-recursive solution to a problem commonly solved with recursion

[@varun25aggarwal]

its the practical application of 11th math permutation and combinations.

[@aps8874]

Thank you :)

[@012akashh]

I would recommend you to also cover system design topic

[@takeUforward]

Insaan hun bhai 😂

[@72nishantwadhawan5]

@@takeUforward 🤣🤣🤣

[@ng3w462]

Thank you Bhaiya for consistently uploading these videos this also motivates us to complete the series!

[@mohitratanpal27]

i m doing left shift of 3 by 1 ,i m getting 6 and not 8 as he said,what wrong i m doing?

[@mumtazirteqaahmed8553]

you need to do left shift of 1 by 3 (1

[@sidhant_khamankar]

Divide integers without using / wala bata do bhaiya GFG ke solution se accept nahi horaha leetcode pe

[@arunpandey1487]

public int divide(int dividend, int divisor) { if(dividend==1=0)?true:false; dividend = Math.abs(dividend); divisor = Math.abs(divisor); int res = 0; while(dividend-divisor>=0) { int count = 0; while(dividend-(divisor

[@manisharya2138]

Thank u so much for my clear 👍👍

[@venkythesmart440]

superb explanation...

[@kunalmodiart]

thanks man.. amazing explaination👌👌

[@kunalbandooni4009]

Can the same problem be implemented using Trie? I feel it would take lesser time, however space would be more.

[@lucy2003-d8p]

I solved this iam happy

[@mdkashifraza2603]

Thank you

[@dillibabu1472]

What is intuition

[@nileshkhimani9315]

If possible, Please upload this SDE SHEET videos asap, on a daily basis. If possible!! It's a humble request. Thanks a Lot though.

[@takeUforward]

Aap is planet pe wapas aaye, aur channel ki ghanti bajakar rakhe tab aapko roz 6 baje samajh aaega ki video aa raha h!!

[@nileshkhimani9315]

@@takeUforward 🤣🤣

[@nileshkhimani9315]

@@takeUforward I meant like sde sheet k order me aaye 🤣

[@nileshkhimani9315]

@@takeUforward me aapke 40000 subscriber the tab se follow kar rha hu 🤣

[@takeUforward]

@@nileshkhimani9315 Likh leta hun UPSC me aaega XD, anyways on a lighter note, I am trying my very best, literally I am working 13/14 hours a day, 9 office + 4 hours yt (research, java code, cpp code, record, edit, upload, render...

[@anil7931]

Thank you so much

[@motabhaimotivation]

but how is it related to trie then?

[@valiz2628]

sir will the article/videos on other topics of recursion are yet to be published??

[@amankothari3288]

sir i get it how this recursion works but i am unable to write my own code .i dont able to think that way . please tell me what should i do .

[@shresthjain7557]

best explanation

[@gamingbar3881]

That's subsequence not substring... Btw amazing explanation❤

[@piyusharora5589]

yet another more optimised solution // T.C O(N*N) vector subsets(vector& nums) { int n = nums.size(); int sets = 1

[@zphsmuddinayanapalli6912]

bhaiya how to say space complexity for this question?

[@dewanandkumar8589]

Understood

[@Shivi32590]

understood

[@sheetalgupta5686]

UNDERSTOOD

[@Learnprogramming-q7f]

Thank you Bhaiya

[@rabbanimunna6992]

Understood!

[@torque6208]

name of the song used int he outro

[@MikrokosmosMuse]

thanks bro you are doing really well. I will definitely go through the whole series

[@taison0072]

Sir please share link of more bitoperator questions.

[@anjneymishra1494]

sir which software you use for teaching

[@almoontasirmoon933]

best explanation bro

[@krishnavamsichinnapareddy]

Understood ❤

[@shreyasingh1258]

bhaiya recursion se complexity to isse achi hui na fir i.e.2 power n. Then what is the need of this?

[@takeUforward]

recursion me printing le lega na N, th 2^n * n hi lg gai and space v lg rhi h auxiliary

[@shreyasingh1258]

@@takeUforward got your point thanks for clarifying so quickly bhaiya!

[@wintermist7921]

Thanks bhaiya👍

[@nileshsinha7869]

understood❤❤

[@v.sreesairam9488]

bhaiya daily video wow! :)

[@parikshitrathore1510]

Understood🔥

[@ArpitKumar-yo6up]

Love for striver bhaiya

[@adarshrai9516]

Thanks bhai 🙏

[@ronakslibrary8635]

US

[@abhimanyu6534]

Plz help in CP QUES

[@gauravmeena511]

done ✅✅

[@avinashkumarrao9728]

god

[@postgres-c4b]

💌💌💌💌💌

[@takeUforward]

Do write "understood" if you understood, motivates me :) Insta: instagram.com/striver_79/​ Telegram: bit.ly/tuftelegram​

[@Priyanshubihari101]

Bc😂😂😂

[@keshav9408]

I humbly request you to not support institution like code Ninja. Self learning is best learning 🙏

[@seraj_valley]

kano m drd krne lgta h kabhi kabhi

[@Usurperhk]

Me watching random youtube video at 2x speed, but when TUF video starts..... "Jaldi speed kam kar jaldi kar, mrko toh aise dhak dhak horella hai re..."

[@abhinanda7049]

understood

[@Code_Solver]

Understood

[@BharathIndia-q1k]

In Striver's SDE sheet, this question was given under Trie Concept. Can anyone inform me how is it related to Trie ?

[@mohammedwaseem8599]

I think if(sub.size()>=0)?? What's your take of bhaiya??

[@shubham57641]

Outstanding approach hats off to you man

[@dingo_5998]

Thank you bhaiya

[@vishalvishwakarma7621]

Nice explanation 🙂🙂🙏

[@PremKumar-rd1uv]

Thanks for this video Anna. Understood the concept

[@khushivernekar3863]

Thank you sir😊, you made this topic crystal clear.

[@selene8721]

Thank you !!

[@anonymosy]

One of the interesting approach I have come to know, thanks striver.

[@hemantpatel1413]

understood

[@harshitjaiswal9439]

understood.

[@aryashjain7893]

should we go for recursion on powerset approach , acc to TC

[@bhaveshkumar6842]

Thank you, Striver!!!!

[@charchitmangal]

Loved this question 😇

[@GhostVaibhav]

Understood 🔥