Power Set | Print all Subsequences
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
---------------------------------------------------------------------------------------------------------------------------------------------------- Pr-Requisites: None
SDE sheet: bit.ly/takeUforward_SDE
✅Use "TAKEUFORWARD" coupon code at Coding Ninjas to get 15% discount.
Coding Ninjas: aff.codingninjas.com/click?o=...
Please Please SUBSKRIIIBEEEEE the new channel: / @striver_79
---------------------------------------------------------------------------------------------------------------------------
✅Placement Series: • Let's give back to the...
✅Placement Series (Arrays, Sorting..): • C++ and Java |Brute-Be...
✅Hashing Playlist: • Two Sum Problem | Leet...
✅Greedy Playlist: • N meetings In One Room...
✅Recursion Playlist: • L8. Combination Sum | ...
✅Graph Playlist: • 3 MAJOR ANNOUNCEMENTS ...
✅Two Pointer Playlist: • 3 SUM | Brute | Better...
✅Binary Search Playlist: • Nth Root of a Number U...
✅LinkedList Playlist: • Reverse a Linked List ...
✅Advanced DS playlist: • Fenwick Tree Tutorial ...
✅Stack&Queue Playlist: • Implementation of Stac...
✅Greedy Algorithms: • N meetings In One Room...
Problem Link: practice.geeksforgeeks.org/pr...
C++/Java code: takeuforward.org/data-structu...
---------------------------------------------------------------------------------------------------------------------------
✅This is where I teach: ----- Use coupon-code "TAKEUFORWARD" for getting 10% on my course at GFG: bit.ly/striver_cpCourse
✅Use coupon-code "TAKEUFORWARD" for getting 10% for all GFG courses: bit.ly/tuf_gfgCourse
---------------------------------------------------------------------------------------------------------------------------
If you appreciate the channel's work, you can join the family: bit.ly/joinFamily
✅Thumbnail Creator: / rikonakhuli
✅ Striver's Linkedin Profile: /
✅ Instagram: /
✅Connect with us: bit.ly/tuftelegram (Use Link in Mobile only, if not works search "takeUforward" in telegram)..
#dsa #striver #leetcode
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!❣✨✨
Sir thank you so much for sharing these amazing explanations with us. 🔥❤
Thanks sir you are literally provided most valuable content and these are really helpful!!:)
thank you so much for sharing these amazing explanations with us.
Thank you for the amazing and helpful videos!
If I would have seen this video teo ayd earlier I would have been placed now 😭😭😭. Anyway thanks bro ❤️
In Which company?
Getting better Day by Day💪💪💪all credit goes to you🙏
Understood......Thank You So Much for this wonderful video.....🙏🏻🙏🏻🙏🏻
Thanks for this video Anna. Understood the concept
I hope you are doing EXTREMELY WELL!!!
Understood.
Thankyou for these videos!
Thank you Bhaiya for consistently uploading these videos this also motivates us to complete the series!
Outstanding approach hats off to you man
Till now, best explanation !!
thanks man.. amazing explaination👌👌
Got to know about Power set
Thank you sir i finally understand from your explanation searching for 2 hr😊.
Loved this question 😇
Thank you, Striver!!!!
One of the interesting approach I have come to know, thanks striver.
Thank u so much for my clear 👍👍
Thanks Striver 79 for uploading videos so frequently.
Striver, can you tell us from where you will get the intuition of the problems?
Fully understood! Keep up the outstanding work.☺️
These are more observation based problems, questions like rainwater trapping and next permutations have intuition..
Thank you so much
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
Yes, explained this in recursion playlist..
Thank you
Can the same problem be implemented using Trie? I feel it would take lesser time, however space would be more.
superb explanation...
Bhaiya is an inspiration for T3 college students
Bhaiya in MSB in O(1) can't we just return (1
In Striver's SDE sheet, this question was given under Trie Concept. Can anyone inform me how is it related to Trie ?
I think
if(sub.size()>=0)?? What's your take of bhaiya??
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
should we go for recursion on powerset approach , acc to TC
Genius non-recursive solution to a problem commonly solved with recursion
Thank you :)
Do write "understood" if you understood, motivates me :)
Insta: instagram.com/striver_79/
Telegram: bit.ly/tuftelegram
thanks bro you are doing really well. I will definitely go through the whole series
If we do 110 & 000 it will give 0 means 0 index is not included in it , which is not true
Nice explanation 🙂🙂🙏
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..."
its the practical application of 11th math permutation and combinations.
best explanation
How can we think about these types of non typical approaches ...
I would recommend you to also cover system design topic
Insaan hun bhai 😂
@@takeUforward 🤣🤣🤣
understood.
Understood!
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 .
What is intuition
best explanation bro
Thanks bhaiya👍
sir will the article/videos on other topics of recursion are yet to be published??
Thank you bhaiya
understood❤❤
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.
AllPossibleStrings(s){
//code here
s=s.trim()
let n =s.length;
let ar=[]
for(let num=0;num
tq
bhaiya daily video wow! :)
I solved this iam happy
Understood
i m doing left shift of 3 by 1 ,i m getting 6 and not 8 as he said,what wrong i m doing?
you need to do left shift of 1 by 3 (1
bhaiya how to say space complexity for this question?
Understood🔥
That's subsequence not substring... Btw amazing explanation❤
Thanks bhai 🙏
Understood ❤
If possible, Please upload this SDE SHEET videos asap, on a daily basis. If possible!! It's a humble request.
Thanks a Lot though.
Aap is planet pe wapas aaye, aur channel ki ghanti bajakar rakhe tab aapko roz 6 baje samajh aaega ki video aa raha h!!
@@takeUforward 🤣🤣
@@takeUforward I meant like sde sheet k order me aaye 🤣
@@takeUforward me aapke 40000 subscriber the tab se follow kar rha hu 🤣
@@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...
understood
but how is it related to trie then?
Understood 🔥
Sir please share link of more bitoperator questions.
Divide integers without using / wala bata do bhaiya
GFG ke solution se accept nahi horaha leetcode pe
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
sir which software you use for teaching
UNDERSTOOD
US
yet another more optimised solution
// T.C O(N*N)
vector subsets(vector& nums) {
int n = nums.size();
int sets = 1
Love for striver bhaiya
Plz help in CP QUES
name of the song used int he outro
bhaiya recursion se complexity to isse achi hui na fir i.e.2 power n. Then what is the need of this?
recursion me printing le lega na N, th 2^n * n hi lg gai and space v lg rhi h auxiliary
@@takeUforward got your point thanks for clarifying so quickly bhaiya!
done ✅✅
god
💌💌💌💌💌
Bc😂😂😂
kano m drd krne lgta h kabhi kabhi
I humbly request you to not support institution like code Ninja. Self learning is best learning 🙏
Thank you Bhaiya
understood
Understood