CoWo (Code World)
CoWo (Code World)
  • Видео 134
  • Просмотров 11 605

Видео

Palindromic Substrings | CodeChef STARTERS 129 | Explanation + Code
Просмотров 686 месяцев назад
Please subscribe if you find it helpful. Question Link: www.codechef.com/problems/GPL
Ballon d Or | CodeChef STARTERS 129 | Explanation + Code
Просмотров 306 месяцев назад
Please subscribe if you find it helpful. Question Link: www.codechef.com/problems/BLNDOR
Minimize Manhattan Distances | LeetCode Weekly Contest 391 | Explanation in Hindi + Code
Просмотров 596 месяцев назад
Please Like and Subscribe if you find it useful.
Anti-Triangle | CodeChef STARTERS 127 | Explanation + Code
Просмотров 837 месяцев назад
Please subscribe if you find it helpful. Question Link: www.codechef.com/problems/ANTITRI
Superincreasing | CodeChef STARTERS 127 | Explanation + Code
Просмотров 767 месяцев назад
Please subscribe if you find it helpful. Question Link: www.codechef.com/problems/SUPINC
E. Girl Permutation | Codeforces Round 936 (Div. 2)| | Explanation in Hindi
Просмотров 607 месяцев назад
Please subscribe if you find it helpful.
Prime Multiples | Mathematics | CSES Sheet | Explanation in Hindi + Code
Просмотров 947 месяцев назад
Please subscribe if you find it helpful.
Longest Common Suffix Queries | LeetCode Weekly Contest 390 | Explanation in Hindi + Code
Просмотров 147 месяцев назад
Please Like and Subscribe if you find it useful.
Most Frequent IDs | LeetCode Weekly Contest 390 | Explanation in Hindi + Code
Просмотров 77 месяцев назад
Please Like and Subscribe if you find it useful.
Minimum moves to pick K Ones | LeetCode Weekly Contest 389 | Explanation in Hindi + Code
Просмотров 1697 месяцев назад
Please Like and Subscribe if you find it useful.
F. Rudolf and Imbalance | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Просмотров 1627 месяцев назад
Please subscribe if you find it helpful.
E. Rudolf and k Bridges | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Просмотров 3527 месяцев назад
Please subscribe if you find it helpful.
D. Rudolf and the Ball Game | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Просмотров 1077 месяцев назад
Please subscribe if you find it helpful.
C. Rudolf and the Ugly String | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Просмотров 737 месяцев назад
Please subscribe if you find it helpful.
A. Rudolf and the Ticket, B. Rudolf and 121 | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Просмотров 1227 месяцев назад
A. Rudolf and the Ticket, B. Rudolf and 121 | Codeforces Round 933 (Div. 3)| | Explanation in Hindi
Counting Rooms | CSES Sheet | Graph Algorithms
Просмотров 397 месяцев назад
Counting Rooms | CSES Sheet | Graph Algorithms
Divisor Analysis | CSES Sheet | Mathematics
Просмотров 1537 месяцев назад
Divisor Analysis | CSES Sheet | Mathematics
Maximum Strength of K Disjoint Subarrays | LeetCode Weekly Contest 388 | Explanation + Code
Просмотров 197 месяцев назад
Maximum Strength of K Disjoint Subarrays | LeetCode Weekly Contest 388 | Explanation Code
Shortest Uncommon Substring in an Array | LeetCode Weekly Contest 388 | Explanation + Code
Просмотров 417 месяцев назад
Shortest Uncommon Substring in an Array | LeetCode Weekly Contest 388 | Explanation Code
Maximize Happiness of Selected Children | LeetCode Weekly Contest 388 | Explanation + Code
Просмотров 137 месяцев назад
Maximize Happiness of Selected Children | LeetCode Weekly Contest 388 | Explanation Code
Apple Redistribution into Boxes | LeetCode Weekly Contest 388 | Explanation + Code
Просмотров 227 месяцев назад
Apple Redistribution into Boxes | LeetCode Weekly Contest 388 | Explanation Code
Swap and Unite | CodeChef STARTERS 124 | Explanation + Code
Просмотров 1177 месяцев назад
Swap and Unite | CodeChef STARTERS 124 | Explanation Code
Make It One | CodeChef STARTERS 124 | Explanation + Code
Просмотров 267 месяцев назад
Make It One | CodeChef STARTERS 124 | Explanation Code
Table Strength | CodeChef STARTERS 124 | Explanation + Code
Просмотров 337 месяцев назад
Table Strength | CodeChef STARTERS 124 | Explanation Code
Distribute Elements Into Two Arrays II | LeetCode Weekly Contest 387
Просмотров 257 месяцев назад
Distribute Elements Into Two Arrays II | LeetCode Weekly Contest 387
Minimum Operations to Write the Letter Y on a Grid | LeetCode Weekly Contest 387
Просмотров 417 месяцев назад
Minimum Operations to Write the Letter Y on a Grid | LeetCode Weekly Contest 387
Count Submatrices with Top-Left Element and Sum Less Than k | LeetCode Weekly Contest 387
Просмотров 117 месяцев назад
Count Submatrices with Top-Left Element and Sum Less Than k | LeetCode Weekly Contest 387
Find the Maximum Sum of Node Values | LeetCode Biweekly Contest 125 | Explanation + Code
Просмотров 557 месяцев назад
Find the Maximum Sum of Node Values | LeetCode Biweekly Contest 125 | Explanation Code
Count Pairs of Connectable Servers in a Weighted Tree Network | LeetCode Biweekly Contest 125
Просмотров 777 месяцев назад
Count Pairs of Connectable Servers in a Weighted Tree Network | LeetCode Biweekly Contest 125

Комментарии

  • @Jay-lj2bv
    @Jay-lj2bv 10 дней назад

    awaaz to badi pyari hai

  • @ayush2060
    @ayush2060 18 дней назад

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

  • @madhavdua8588
    @madhavdua8588 27 дней назад

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

  • @kirangkumar057
    @kirangkumar057 2 месяца назад

    Thanks

  • @AnkitRaj-ux7lv
    @AnkitRaj-ux7lv 3 месяца назад

    good content mam

  • @MAMTAKUMARI-so6wy
    @MAMTAKUMARI-so6wy 3 месяца назад

    nice solution😊

  • @Legend-gx6je
    @Legend-gx6je 4 месяца назад

    Good explained keep working

  • @anshull.s
    @anshull.s 5 месяцев назад

    Thankyou!

  • @Iammuslim947
    @Iammuslim947 5 месяцев назад

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

  • @pankaj_buddy
    @pankaj_buddy 5 месяцев назад

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

    • @pankaj_buddy
      @pankaj_buddy 5 месяцев назад

      are u giving it or not?

  • @pankaj_buddy
    @pankaj_buddy 5 месяцев назад

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

  • @iayushch
    @iayushch 5 месяцев назад

    Great explanation.

  • @scarywitcher
    @scarywitcher 6 месяцев назад

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

    • @cowo08
      @cowo08 5 месяцев назад

      Sorry for the inconvenience, I have used that to remove noise.

  • @NewsPulse36080
    @NewsPulse36080 6 месяцев назад

    Nice Explanation

  • @akankshamaloo2558
    @akankshamaloo2558 6 месяцев назад

    Helpful!!

  • @KhemendraBhardwaj
    @KhemendraBhardwaj 6 месяцев назад

    Thanks for the explanation, very helpful !

    • @cowo08
      @cowo08 6 месяцев назад

      Glad you liked it.

  • @cowo08
    @cowo08 6 месяцев назад

    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(); } }

  • @cowo08
    @cowo08 6 месяцев назад

    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(); } }

  • @cowo08
    @cowo08 6 месяцев назад

    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(); } }

  • @OnlyAyushAgarwal
    @OnlyAyushAgarwal 6 месяцев назад

    Nice

  • @OnlyAyushAgarwal
    @OnlyAyushAgarwal 7 месяцев назад

    Nice

  • @hkrai1372
    @hkrai1372 7 месяцев назад

    thnx please keep uploading video solution of hard problems

  • @cowo08
    @cowo08 7 месяцев назад

    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; } };

  • @TON-108
    @TON-108 7 месяцев назад

    Thanks, very well explained!

  • @mastitime6093
    @mastitime6093 7 месяцев назад

    Didi AP bhi participate kiye the kya kal?

    • @cowo08
      @cowo08 7 месяцев назад

      yes

  • @cowo08
    @cowo08 7 месяцев назад

    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(); } }

  • @cowo08
    @cowo08 7 месяцев назад

    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(); } }

    • @devanshuu
      @devanshuu 7 месяцев назад

      Hey, agar lets se array size is 100 and k=32, and x is very close to 10^9 then it might be possible that, the other indexes of array overflows 10^9, so what about that, we need to take care of that as well

    • @cowo08
      @cowo08 7 месяцев назад

      @@devanshuu There is no bound on the elements we can use for the array , it can also go beyond 10^9

  • @faiazmahmud6277
    @faiazmahmud6277 7 месяцев назад

    4 views lol

  • @cowo08
    @cowo08 7 месяцев назад

    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(); } }

  • @Hitswithjk
    @Hitswithjk 7 месяцев назад

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

    • @cowo08
      @cowo08 7 месяцев назад

      Thank you so much for your kindness.

  • @filmymovies2100
    @filmymovies2100 7 месяцев назад

    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

    • @cowo08
      @cowo08 7 месяцев назад

      Sure :)

  • @akankshamaloo2558
    @akankshamaloo2558 7 месяцев назад

    Great explanation ❤

  • @cowo08
    @cowo08 7 месяцев назад

    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(); } }

  • @Sudevya
    @Sudevya 7 месяцев назад

    hello , where r u from ?

  • @RandomAshuraStuff
    @RandomAshuraStuff 7 месяцев назад

    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...

    • @cowo08
      @cowo08 7 месяцев назад

      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(); } }

  • @ishankbansal9239
    @ishankbansal9239 7 месяцев назад

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

    • @cowo08
      @cowo08 7 месяцев назад

      will make it.

    • @ishankbansal9239
      @ishankbansal9239 7 месяцев назад

      @@cowo08 Thanks, btw great explanation

  • @tanishqgupta4483
    @tanishqgupta4483 7 месяцев назад

    kuch samjh nhi aya :((

    • @himanshutrivedi9370
      @himanshutrivedi9370 7 месяцев назад

      you know how a priority queue works (min heap ). study the data structure and then rewatch

  • @himanshutrivedi9370
    @himanshutrivedi9370 7 месяцев назад

    great explanation .

  • @RanjanKumar-eu6qu
    @RanjanKumar-eu6qu 7 месяцев назад

    Very Well Explained 🙌

  • @chiddarth9600
    @chiddarth9600 7 месяцев назад

    pretty good explanation

  • @lakshyasharma3723
    @lakshyasharma3723 7 месяцев назад

    Are you on codeforces also?

    • @cowo08
      @cowo08 7 месяцев назад

      yes, You can get the latest codeforces contest videos on this channel.

  • @adityachaturvedi4369
    @adityachaturvedi4369 7 месяцев назад

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

    • @cowo08
      @cowo08 7 месяцев назад

      Sure:)

  • @shanvi_ojha
    @shanvi_ojha 7 месяцев назад

    Working professional?

    • @cowo08
      @cowo08 7 месяцев назад

      No

    • @shanvi_ojha
      @shanvi_ojha 7 месяцев назад

      @@cowo08 everybody have exams now that's why I thought (except iits)

  • @lakshyasharma3723
    @lakshyasharma3723 7 месяцев назад

    Nice Explanation

  • @joymazumder-kr2og
    @joymazumder-kr2og 8 месяцев назад

    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 ❤❤

  • @deependrapatel5479
    @deependrapatel5479 8 месяцев назад

    great video

  • @mahtoji8935
    @mahtoji8935 8 месяцев назад

    your videos are really helpful

  • @mahtoji8935
    @mahtoji8935 8 месяцев назад

    congrats for the 100 subscriber

  • @aravind-haridas
    @aravind-haridas 8 месяцев назад

    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.

    • @cowo08
      @cowo08 8 месяцев назад

      Thankyou for the feedback. Will keep that mind :)

  • @satyagyasingh6279
    @satyagyasingh6279 8 месяцев назад

    explained correctly