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!❣✨✨
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.
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
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
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..."
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
@@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...
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!❣✨✨
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..
If I would have seen this video teo ayd earlier I would have been placed now 😭😭😭. Anyway thanks bro ❤️
In Which company?
Understood......Thank You So Much for this wonderful video.....🙏🏻🙏🏻🙏🏻
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
I hope you are doing EXTREMELY WELL!!!
// 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
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
Sir thank you so much for sharing these amazing explanations with us. 🔥❤
How can we think about these types of non typical approaches ...
Outstanding approach hats off to you man
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..
If we do 110 & 000 it will give 0 means 0 index is not included in it , which is not true
Thanks sir you are literally provided most valuable content and these are really helpful!!:)
One of the interesting approach I have come to know, thanks striver.
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??
Bhaiya is an inspiration for T3 college students
thank you so much for sharing these amazing explanations with us.
Genius non-recursive solution to a problem commonly solved with recursion
Thank you sir i finally understand from your explanation searching for 2 hr😊.
Thanks for the videos. one doubt, 6th index should be cb right why bc?
Thank you sir😊, you made this topic crystal clear.
Bhaiya in MSB in O(1) can't we just return (1
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..."
I would recommend you to also cover system design topic
Insaan hun bhai 😂
@@takeUforward 🤣🤣🤣
its the practical application of 11th math permutation and combinations.
Thanks Striver 79 for uploading videos so frequently.
Can the same problem be implemented using Trie? I feel it would take lesser time, however space would be more.
should we go for recursion on powerset approach , acc to TC
Thank you for the amazing and helpful videos!
Understood.
Thankyou for these videos!
Thanks for this video Anna. Understood the concept
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
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 .
sir will the article/videos on other topics of recursion are yet to be published??
Till now, best explanation !!
yet another more optimised solution
// T.C O(N*N)
vector subsets(vector& nums) {
int n = nums.size();
int sets = 1
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
it's the same video that you also added in bit manipulation
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...
Loved this question 😇
Thank you Bhaiya for consistently uploading these videos this also motivates us to complete the series!
Thank you Striver, understood
Got to know about Power set
but how is it related to trie then?
Thank you, Striver!!!!
Nice explanation 🙂🙂🙏
That's subsequence not substring... Btw amazing explanation❤
Thank you !!
bhaiya how to say space complexity for this question?
What is intuition
thanks man.. amazing explaination👌👌
thanks bro you are doing really well. I will definitely go through the whole series
Thank u so much for my clear 👍👍
best explanation
superb explanation...
Sir please share link of more bitoperator questions.
I solved this iam happy
Thank you
Thank you so much
Thank you :)
UNDERSTOOD
name of the song used int he outro
sir which software you use for teaching
Understood!
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!
understood.
best explanation bro
Understood ❤
bhaiya daily video wow! :)
Understood🔥
Love for striver bhaiya
Understood
understood
Thanks bhai 🙏
Thanks bhaiya👍
understood❤❤
Plz help in CP QUES
done ✅✅
US
god
💌💌💌💌💌
Do write "understood" if you understood, motivates me :)
Insta: instagram.com/striver_79/
Telegram: bit.ly/tuftelegram
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 🙏
Understood 🔥
Understood
Thank you bhaiya
Thank you Bhaiya
understood
understood