Видео

expert in explanation too !!

2:34:32 What if we have same triplet like [1,3,6] and [1,3,6] is this case it wont satisfy the conditions right.

why do you start from C and not A

Thanks for the explanations, it was really helpful.

were you streaming during the contest, why though!?

Really helpful video broo

many a times I am able to make a correct logic for the questions but fail in implementation , either it take a lot time to implement the logic or sometimes I can't implement it, Please suggest something to overcome, I will definitely work on that.

User #include <bits/stdc++.h> using namespace std; void sol() { int n1,n2; cin>>n1>>n2; vector<int>v1(n1,0),v2(n2,0); int ans = 0; for(int i = 0; i < n1; i++) { int x; cin>>x; v1[i] = x; } for(int i = 0; i < n2; i++) { int x; cin>>x; v2[i] = x; } sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end()); reverse(v1.begin(),v1.end()); reverse(v2.begin(),v2.end()); ans+=v1[0]+v1[1]+v1[2]+v1[3]+ v2[0]+v2[1]+v2[2]+v2[3]; if(n1 < 4 || n2 < 4 || n1+n2 < 11) { cout<<-1<<endl; return ; } int i = 4 ,j=4; for(int k = 0 ; k < 3; k++) { if(i < n1 && j < n2) { if(v1[i] >= v2[j]) { ans+=v1[i]; i++; } else { ans+=v2[j]; j++; } } else { if(i < n1) { ans+=v1[i]; i++; } else { ans+=v2[j]; j++; } } } cout<<ans<<endl; return; } int main() { int t; cin>>t; while(t--) { sol(); } } what is the difference between between my code and your code

Nice 👍

brother since how long you're coding and giving contests? How to improve logic building mere bhai? Pls tips dedo

what is the problem in my code?????? ignore the commented part import java.util.*; class Codechef { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for (int i = 0; i < t; i++) { int n = sc.nextInt(); // Number of batsmen int m = sc.nextInt(); // Number of bowlers if(n>=4 && m>=4 && (n+m)>=11) { //permit to select the team members int batsman[]=new int[n]; for(int j=0;j<n;j++) { batsman[j]=sc.nextInt(); } int bowler[]=new int[m]; for(int j=0;j<m;j++) { bowler[j]=sc.nextInt(); } Arrays.sort(batsman); Arrays.sort(bowler); int bat=n-1; int bow=m-1; int sum=0; int c=4; while(c>0) { sum+=(batsman[bat]+bowler[bow]); bat--; bow--; c--; } //int pn=3;players neded is 3 as 8 are summed up //3---->bowlers //3---->batsman //3 bowlers or batsman for(int pn=0;pn<3;pn++) { if(bat>=0 && bow>=0) { if(batsman[bat]>=bowler[bow]) { sum+=batsman[bat]; bat--; }else{ sum+=bowler[bow]; bow--; } }else if(bat>=0) { sum+=batsman[bat]; bat--; }else{ sum+=bowler[bow]; bow--; } } System.out.println(sum); } else{ System.out.println("-1"); } } } }

how your snippet is autosaved in the codechef ide

Just always waiting for your videos guru !!!

Bhaiya pls guide me i want to do an internship but dont know how to crack it pls make a separate video on it 😢

nice explanation but improve sound quality

Bhaiya,wanted to ask a question where to ask? Mail or anything?

brother, i wanna to start cp woth Codeforces. Could you guide me

what is the name of the vscode extension which is having inputs ?

Orz

Bhaiya i visited your linkedin profile, can you explain your protects too if possible, it would be a great thing 😅

Keep posting bro, i am also learning from you ❤

how you setup vs code i am new in cp

Good bro

For the last problem instead of a mask is it possible to use set or visited map something like that to store the song that I have visited. I mean what is the purpose of using mask here?

nice explanation

try speaking english please

very good explanation. but also include the codes in ur description as pastebin link. then entire video will be complete

Thanks for such a nice explanation

Explained very well 👍

Please stop providing solutions during contests Otherwise you'll be banned from codeforces

How did you come to the conclusion that you can't use DP for C so quickly? Was it because of the constraints? I kept thinking that it was DP on trees question during the contest 😅

Great explanation!

It's really helpful 👍

I want to also start dsa preparation From where should I start any resource

Orz

Problem D can be solved without 2 segment trees ( we can utilise left and right array for checking if a range has all element same ) submission link - codeforces.com/contest/1923/submission/248037070

I was waiting for your very informative video 🙏🙏

Very helpful 🙏👍

learned new insights on how to approach a question like an expert!! I don't know if you're intentionally doing it for some reason but I just wanna highlight that instead of doing manual debugging using debugger can speed up the process : )

🙏 Like the way of explanation sir

Minimise maximum subarray code: if(x-1 > y) { int division = ceil( (1.0)*x / (y+1) ); if(division >= 3) { division = x-2*y; } ans = division; } else { ans = 1; }

5 star🤩🤩

Thank you sir 🙏

Very informative 👍

approach is good for D ques

OP sir🔥🔥

in batgrip tumhe kese pta chla ki n ko starting mein laa skte h

Fuck tourist, i'll watch this..

Nice 👍

Thankyou sir