Видео

awaaz to badi pyari hai

I just love your explanation , Thank you so much for this .

Congratulations for getting placed at Microsoft🎊 Can u share some suggestions to land such job for students.

Thanks

good content mam

nice solution😊

Good explained keep working

Thankyou!

i was struggling with this qn u explained very neatly.Thnx. whats ur cf handle btw?

how much is your rating on CF, give your email i wana connect with you

I should say that your voice is stunning, i like it very much

Great explanation.

why are you using ai voice in you new videos, they are hurting my ears

Nice Explanation

Helpful!!

Thanks for the explanation, very helpful !

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 void solve() { int n; cin>>n; int cnt=0; for(int i=0;i<n;i++) { int temp; cin>>temp; if(temp == 2) cnt++; } if(cnt%8 == 0) { cout<<"YES "; } else cout<<"NO "; } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 void solve() { int n; cin>>n; string s; cin>>s; int zeros=0; for(int i=0;i<n;i++) { if(s[i]=='0') zeros++; } if(zeros == n||zeros ==0) { if(n%2 >0) { cout<<"Bob "; } else cout<<"Alice "; } else if(n>3) { if(n%2 >0) { //alice int temp = (n-3)/2; if(zeros<=temp || (n-zeros)<=temp) { cout<<"BOB "; } else cout<<"Alice "; } else { //bob int temp = (n-3)/2 + (n-3)%2; if(zeros<=temp || (n-zeros)<=temp) { cout<<"Alice "; } else cout<<"Bob "; } } else if(n==3){ cout<<"Alice "; } else cout<<"Bob "; } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 void solve() { int n,s; cin>>n>>s; int arr[n]; for(int i=0;i<n;i++) arr[i]=1; if(s%2 >0 || n==1||s<n) { cout<<"-1 "; return; } else if(n==3) { int temp = s/2,store=-1; for(int i=30;i>=0;i--) { if(((1ll<<i)&temp)>0) { store = i; break; } } if( store==-1 ||(1ll<<store) == temp) { cout<<"-1 "; return; } else { cout<<temp<<" "<<(1ll<<store)<<" "<<(temp-(1ll<<store))<<" "; return; } } else { if(n%2 == 0) { int temp = (s-(n-2))/2; arr[0] = temp; arr[1] = temp; } else { arr[0]=2; arr[1]=3; arr[2]=1; s-=(n-5)+6; if(s%2 >0 || s<2) { cout<<"-1 "; return; } else { arr[n-1]=s/2; arr[n-2]=s/2; } } } for(int i=0;i<n;i++) cout<<arr[i]<<" "; cout<<" "; } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

Nice

Nice

thnx please keep uploading video solution of hard problems

Code: class Solution { public: pair<int,int> find(vector<vector<int>>& points,vector<int>&visited) { int n = points.size(); int maxy=-1; //x+y int mixy=-1; // x+y int yx=-1; // y-x int xy=-1; //x-y int ans =-1; int p1=-1; int p2=-1; for(int i=0;i<n;i++) { if(visited[i]==0) { if(maxy !=-1) { //x+y int d = abs(points[maxy][0]-points[i][0])+abs(points[maxy][1]-points[i][1]); if(d>ans) { p1 = i; p2 = maxy; ans = d; } } if(mixy !=-1) { //x+y minm int d = abs(points[mixy][0]-points[i][0])+abs(points[mixy][1]-points[i][1]); if(d>ans) { p1 = i; p2 = mixy; ans = d; } } if(yx !=-1) { int d = abs(points[yx][0]-points[i][0])+abs(points[yx][1]-points[i][1]); if(d>ans) { p1 = i; p2 = yx; ans = d; } } if(xy !=-1) { int d = abs(points[xy][0]-points[i][0])+abs(points[xy][1]-points[i][1]); if(d>ans) { p1 = i; p2 = xy; ans = d; } } // i x+y if(maxy <0 || points[maxy][0]+points[maxy][1]<points[i][0]+points[i][1]) maxy =i; if(mixy <0 || points[mixy][0]+points[mixy][1]>points[i][0]+points[i][1] ) mixy = i; //mixy = x+Y if(yx <0 || points[yx][1]-points[yx][0]<points[i][1]-points[i][0]) yx = i; if(xy <0 || points[xy][0]-points[xy][1]<points[i][0]-points[i][1]) xy =i; } } return {p1,p2}; } int minimumDistance(vector<vector<int>>& points) { int n = points.size(); vector<int>visited(n,0); pair<int,int>p = find(points,visited); // p1 visited[p.first]=1; pair<int,int>p1 = find(points,visited); int ans = abs(points[p1.first][0]-points[p1.second][0]) + abs(points[p1.second][1]-points[p1.first][1]); visited[p.first]=0; visited[p.second]=1; p1 = find(points,visited); ans = min(ans,abs(points[p1.first][0]-points[p1.second][0]) + abs(points[p1.second][1]-points[p1.first][1])); return ans; } };

Thanks, very well explained!

Didi AP bhi participate kiye the kya kal?

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 void solve() { int n,l; cin>>n>>l; int curr=2,prev=1; cout<<"1 "; for(int i=0;i<n-1;i++) { if(curr+prev <= l) { cout<<curr<<" "; prev = curr; curr++; } else { curr=prev+l; cout<<curr<<" "; prev =curr; } } cout<<" "; } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 void solve() { int n,k,x; cin>>n>>k>>x; if(pow(2ll,k-1)<=x) { cout<<"YES "; } else cout<<"NO "; } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

4 views lol

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define pp pair<int, int> #define mod 1000000007 int ffact[200001]; int mul(int x,int y){ return ((x%mod)*(y%mod))%mod; } int powers(int x,int p){ x=x%mod; if(p==0) return 1; if(p==1) return x%mod; int z=powers(x,p/2); if(p%2>0) return mul(x,mul(z,z)); return mul(z,z); } int dividing(int x,int y){ return mul(x,powers(y,mod-2)); } int ncr(int n,int r) { return dividing(ffact[n],mul(ffact[n-r],ffact[r])); } int fact(int n) { return ffact[n]; } void solve() { int n,m1,m2; cin>>n>>m1>>m2; int pref[m1]; int suff[m2]; int arr[n+1]; memset(arr,0,sizeof(arr)); for(int i=0;i<m1;i++) { cin>>pref[i]; arr[pref[i]]++; } for(int i=0;i<m2;i++){ cin>>suff[i]; arr[suff[i]]+=2; } if(pref[m1-1]!=suff[0] || pref[0]!=1 || suff[m2-1]!=n) { cout<<"0 "; return; } int front = pref[m1-1]-1, last = n-suff[0]; int ans = ncr(n-1,front); int ways = front; for(int i=front;i>=1;i--) { if(arr[i]!=1) { ans = mul(ans,(ways-1)); } ways--; } ways = last; for(int i=suff[0]+1;i<=n;i++) { if(arr[i]!=2) { ans = mul(ans,(ways-1)); } ways--; } cout<<ans<<" "; } int32_t main() { int t = 1; cin >> t; ffact[1]=1; ffact[0]=1; for(int i=2;i<200001;i++) { ffact[i]=mul(ffact[i-1],i); } while (t > 0) { t--; solve(); } }

Maine aap k liye video eadit and . Thumbnail bnaa k de skta hun ❤ free

Amazing explainaition ma'am. Please keep making these. Also just 1request that whenever u r explaining the concept of a question, please do so with the help of an example that is by taking actual numners and not by variables. Please ma'am

Great explanation ❤

Code: #include <bits/stdc++.h> using namespace std; #define int long long int #define F first #define S second #define pb push_back #define si set<int> #define p pair<int, int> void solve() { int n; cin >> n; for(int i=30;i>=0;i--) { if((1ll<<i) <=n) { cout<<(1ll<<i)<<" "; return; } } } int32_t main() { int t = 1; cin >> t; while (t > 0) { t--; solve(); } }

hello , where r u from ?

can you please copy paste the code in the comments so that i will convert this in python bcz i did learn C but not cpp...

Will you make video on problem G of this round(933), I'm not able to get the intuition from the tutorial

kuch samjh nhi aya :((

great explanation .

Very Well Explained 🙌

pretty good explanation

Are you on codeforces also?

Awesome explaination.Pls cover the solutions for other cses problems also

Working professional?

Nice Explanation

Where are you From? Which College? Can I connect with you any social platform linkedin or anything? By the way, your teaching skill is good. I stuck at c but now i understand this ❤❤

great video

your videos are really helpful

congrats for the 100 subscriber

Would it be possible for you to provide English subtitles or explanations alongside your Hindi content? It would make your tutorials more accessible to viewers like me who don't speak Hindi.

explained correctly