ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
great solution and explanation
VERYYY WELL EXPLAINED !! volume was little low
thank u bro, i had almost figured out but deviated from the logic because of rushing unnecessarily
Thanks brother!Yes, these questions do require patient solving!All the best for the upcoming contents!
sir this was very good solution i can now understand this problem thank you sir and you are study or what
Thanks!I'm a 2nd year CS undergraduate student from BIT Mesra
The Code is given Below:int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ll t; cin>>t; while(t--){ ll n; cin>>n; string s; cin>>s; setS; ll ans=0; for (ll i=0; i
Loved your explanation!
@@thequacker6504 Thank you soo much ✨
this question also has a tag of dp can it be solved using that???
Yes, it can be solved! But will be hard to understand and explain too so didn't went that way
Bro do I have to study combinatorics deeply to solve questions having rating(1000-1100 )???
Not really..Just some basic permutation stuffs are required for upto 1100..
you tried well , but made lot of mistakes , hope you will find them . good luck dude!!
Thanks! Surely , will improve 💫
you are not audible
Sorry mate.. new video mein audio improve kiye hai.. filhaal earphones pehen ke sun lo
bro thoda jor se bola kr
Okay bro..will take your advice into account..abhi thoda low budget chal rahe hai 😅
great solution and explanation
VERYYY WELL EXPLAINED !! volume was little low
thank u bro, i had almost figured out but deviated from the logic because of rushing unnecessarily
Thanks brother!
Yes, these questions do require patient solving!
All the best for the upcoming contents!
sir this was very good solution i can now understand this problem thank you sir and you are study or what
Thanks!
I'm a 2nd year CS undergraduate student from BIT Mesra
The Code is given Below:
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
string s;
cin>>s;
setS;
ll ans=0;
for (ll i=0; i
Loved your explanation!
@@thequacker6504 Thank you soo much ✨
this question also has a tag of dp can it be solved using that???
Yes, it can be solved! But will be hard to understand and explain too so didn't went that way
Bro do I have to study combinatorics deeply to solve questions having rating(1000-1100 )???
Not really..Just some basic permutation stuffs are required for upto 1100..
you tried well , but made lot of mistakes , hope you will find them . good luck dude!!
Thanks! Surely , will improve 💫
you are not audible
Sorry mate.. new video mein audio improve kiye hai.. filhaal earphones pehen ke sun lo
bro thoda jor se bola kr
Okay bro..will take your advice into account..abhi thoda low budget chal rahe hai 😅