- 63
- 7 536
Ajit Kushwaha
India
Registrace 10. 01. 2022
Hello everyone! I’m Ajit Kushwaha, a third-year undergraduate student at NSUT. I’m passionate about competitive programming, coding on platforms like Codeforces and LeetCode, and creating tech-related content. Join me as I dive into data structures and algorithms (DSA) and explore all things related to programming and tech !” 🚀👨💻
"Moreover you can connect me on Linkedin :)".
"Moreover you can connect me on Linkedin :)".
B. Make Majority | Codeforces Round 958 Solution | #codeforces | Ajit Kushwaha | #codeforcescontest
Checkout the Code of the problem on the website :
www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html
In this video, i have discussed Codeforces Round 958 Solution contest and explore the solution for the problem “B. Make Majority” problem solution. If you aren't able to solve do watch it out .
Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻
#coding
#codeforces
#codeforcessolutions
#coding
#codeforcessolution
#codechef
#codeforcescontest
#programming #codingtips #competitiveprogramming #algorithm #problem-solving
www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html
In this video, i have discussed Codeforces Round 958 Solution contest and explore the solution for the problem “B. Make Majority” problem solution. If you aren't able to solve do watch it out .
Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻
#coding
#codeforces
#codeforcessolutions
#coding
#codeforcessolution
#codechef
#codeforcescontest
#programming #codingtips #competitiveprogramming #algorithm #problem-solving
zhlédnutí: 87
Video
A. Split the Multiset | Codeforces Round 958 Solution | #codeforces | Ajit Kushwaha | #contest
zhlédnutí 132Před dnem
Checkout the Code of the problem on the website : www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html In this video, i have discussed Codeforces Round 958 Solution contest and explore the solution for the problem “A. Split the Multiset ” problem solution by Ajit Kushwaha. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding ski...
C. Increasing Sequence with Fixed OR | Codeforces Round 958 Solution | #codeforces | Ajit Kushwaha
zhlédnutí 51Před dnem
Checkout the Code of the problem on the website : www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html In this video, i have discussed Codeforces Round 958 Solution contest and explore the solution for the problem “C. Increasing Sequence with Fixed OR ” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skill...
3207. Maximum Points After Enemy Battles | Leetcode Biweekly Contest 134 Solution | Ajit Kushwaha
zhlédnutí 82Před 21 dnem
In this video, i have discussed Leetcode Biweekly Contest 134 contest and explore the solution for the problem “3207. Maximum Points After Enemy Battles ” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻 #coding #leetcodesolutions #leetcode #leetcodecontest #leetcode...
Alternating Groups II | Leetcode Biweekly Contest 134 Solution | #leetcode | Ajit Kushwaha
zhlédnutí 36Před 21 dnem
In this video, i have discussed Leetcode Biweekly Contest 134 contest and explore the solution for the problem “Alternating Groups II” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻 #coding #leetcodesolutions #leetcode #leetcodecontest #leetcodesolution #leetcodepr...
Alternating Groups I | Leetcode Biweekly Contest 134 Solution | #leetcode | Ajit Kushwaha
zhlédnutí 29Před 21 dnem
In this video, i have discussed Leetcode Biweekly Contest 134 contest and explore the solution for the problem “Alternating Groups I” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻 #coding #leetcodesolutions #leetcode #leetcodecontest #leetcodesolution #leetcodepro...
Amphibian Escape | Codechef Starter 141 Solution | #codeforces | Ajit Kushwaha
zhlédnutí 131Před 21 dnem
In this video, i have discussed Codechef Starter 141 Solution contest and explore the solution for the problem “Amphibian Escape ” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻 #codechefsolution #codesolution #codechefsolution #codechefcontest #codecehfstartersolu...
Redundant Array | Codechef Starter 141 Solution | #codeforces | Ajit Kushwaha
zhlédnutí 100Před 21 dnem
In this video, i have discussed Codechef Starter 141 Solution contest and explore the solution for the problem “Redundant Array ” problem solution. If you aren't able to solve do watch it out . Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨💻 #codechefsolution #codesolution #codechefsolution #codechefcontest #codecehfstartersolut...
A. Catch the Coin | Educational Codeforces Round 167 Solution | #codeforces | #codeforcescontest
zhlédnutí 573Před měsícem
A. Catch the Coin | Educational Codeforces Round 167 Solution | #codeforces | #codeforcescontest
B. Substring and Subsequence | Educational Codeforces Round 167 Solution | #codeforces
zhlédnutí 516Před měsícem
B. Substring and Subsequence | Educational Codeforces Round 167 Solution | #codeforces
C. Two Movies | Educational Codeforces Round 167 Solution | #codeforces | #codeforcescontest
zhlédnutí 521Před měsícem
C. Two Movies | Educational Codeforces Round 167 Solution | #codeforces | #codeforcescontest
Make Permutation solution | Codechef Starters 140 Solution | #codechef | #pcd
zhlédnutí 138Před měsícem
Make Permutation solution | Codechef Starters 140 Solution | #codechef | #pcd
Split permutation solution | Codechef Starters 140 Solution | #codechef | #pcd
zhlédnutí 66Před měsícem
Split permutation solution | Codechef Starters 140 Solution | #codechef | #pcd
Trick Or Treat solution | Codechef Starters 140 Solution | #codechef | #pcd
zhlédnutí 136Před měsícem
Trick Or Treat solution | Codechef Starters 140 Solution | #codechef | #pcd
E. Beautiful Array | Codeforces Round 954 (Div. 3) Solution | Ajit Kushwaha | #codeforces
zhlédnutí 92Před měsícem
E. Beautiful Array | Codeforces Round 954 (Div. 3) Solution | Ajit Kushwaha | #codeforces
C. Manhattan Permutations | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
zhlédnutí 364Před měsícem
C. Manhattan Permutations | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
B. New Bakery | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
zhlédnutí 128Před měsícem
B. New Bakery | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
A. Alice and Books | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
zhlédnutí 178Před měsícem
A. Alice and Books | Codeforces Round 953 (Div. 2) Solution | Ajit Kushwaha
Merge Sorted Array | Top Interview 150 Leetcode Solution | Ajit Kushwaha
zhlédnutí 20Před měsícem
Merge Sorted Array | Top Interview 150 Leetcode Solution | Ajit Kushwaha
974. Subarray Sums Divisible by K | Leetcode Problem of the Day Solution | Ajit Kushwaha
zhlédnutí 14Před měsícem
974. Subarray Sums Divisible by K | Leetcode Problem of the Day Solution | Ajit Kushwaha
Maximum Length of a Good Subsequence I | Recursion + memoization solution | Leetcode Biweekly 132
zhlédnutí 38Před měsícem
Maximum Length of a Good Subsequence I | Recursion memoization solution | Leetcode Biweekly 132
648. Replace Words | Leetcode Problem of the Day Solution | Ajit Kushwaha
zhlédnutí 22Před měsícem
648. Replace Words | Leetcode Problem of the Day Solution | Ajit Kushwaha
846. Hand of Straights | Leetcode Problem of the Day Solution | Ajit Kushwaha
zhlédnutí 24Před měsícem
846. Hand of Straights | Leetcode Problem of the Day Solution | Ajit Kushwaha
1002. Find Common Characters | Leetcode Problem of the Day Solution | Ajit Kushwaha
zhlédnutí 42Před měsícem
1002. Find Common Characters | Leetcode Problem of the Day Solution | Ajit Kushwaha
409. Longest Palindrome | Leetcode Problem of the Day Solution | Ajit Kushwaha
zhlédnutí 20Před měsícem
409. Longest Palindrome | Leetcode Problem of the Day Solution | Ajit Kushwaha
Append Characters to String to Make Subsequence | Leetcode Daily Problem Solution | Ajit Kushwaha
zhlédnutí 13Před měsícem
Append Characters to String to Make Subsequence | Leetcode Daily Problem Solution | Ajit Kushwaha
3110. Score of a String | Leetcode Problem of the day Solution | Ajit Kushwaha
zhlédnutí 24Před měsícem
3110. Score of a String | Leetcode Problem of the day Solution | Ajit Kushwaha
B. Increase/ Decrease / Copy | Codeforces Educational Round 166 Div 2 Solution | Ajit Kushwaha
zhlédnutí 143Před měsícem
B. Increase/ Decrease / Copy | Codeforces Educational Round 166 Div 2 Solution | Ajit Kushwaha
C. Chamo and Mocha's array | Codeforces Round 947 (Div 1 + Div 2) solution | Ajit Kushwaha
zhlédnutí 285Před 2 měsíci
C. Chamo and Mocha's array | Codeforces Round 947 (Div 1 Div 2) solution | Ajit Kushwaha
| B. 378QAQ and Mocha'Array | Codeforces Round 947 (Div1+Div2) Solution | Ajit Kushwaha
zhlédnutí 144Před 2 měsíci
| B. 378QAQ and Mocha'Array | Codeforces Round 947 (Div1 Div2) Solution | Ajit Kushwaha
v helpful video brdr <3
Same logic used but there is mistake in my implementation thanks for the video😊
REALLY HELPFUL AND EASY TO UNDERSTAND
It's great that you liked it. do subscribe for upcoming videos :) .
Hello brother
Hi 👋
Make a playlist
Alright i'll do that but make sure to subscribe for upcoming videos :)
test case-> 20 6 18. The above formula returns b = 6, when a = 8. So, we can make 6 pairs with dif B. where A = 8, but we can actually make only five pairs (8,5) to (8,1). correct this pls.
Your solutions are really great. but a small recommendation as a well wisher, work more on your expressions. Sorry for being rude
Yeah thanks will definitely try to improve this . Also the soul reason of building this channel was to improve myself . To focus on speaking fluently + improving the personality. Will definitely work on this .
@@ajitkushwaha3101 Kudos on the solutions btw. Keep up the great work
In case you understood the Problem do like and comment , as well you can check out the code on this website :) www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html
In case you understood the Problem do like and comment , as well you can check out the code on this website :) www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html
In case you understood the Problem do like and comment , as well you can check out the code on this website :) www.ajitkushwaha.tech/2024/07/codeforces-round-958-div-2-b-c-solution.html
same code not working
You can comment your code I can tell you where is the error .
my approach got TLE
brother ..place code share in this comment most of the help !!!!!!!!!
bro what was the use of l and r information given ?
Thanks, you saved my hours of solving it.
Nice job dude! I was thinking to solve this one very complex way and you just did it easily +_+Respect. Can you please tell me how can I learn this kind of stuffs, any references, any resources or website you wanna mention?
Thanks a lot ..!! I wasn't getting why TLE came.
thats called clean explaination
Thanks , i am superrrrr happy that you liked it :) . Do subscribe for upcoming PCD Videos
good explanation
Thanks , i am superrrrr happy that you liked it :) . Do subscribe for upcoming PCD Videos
Awesome bro, keep up the good work
Thanks , I am superrrrr happy that you liked it . Do subscribe us for upcoming PCD :).
great explaination bro
Thanks , I am superrrrr happy that you liked it . Do subscribe us for upcoming PCD :).
how to get the idea for this kind of questions?
This problem was completely based on observation , the more you practice you'll start understanding the mindset behind problem .
Due to some editing constraints video is already at 1.25x , so i really recommend to watch at normal speed only :) Sorry for this !🥲
Those who don't understand can do this : cout << (y >= -1 ? "YES" : "NO") << ' ';
Yes true , we just need to do this .
very good
Thanks , Do subscribe us :) . From now onwards i'll be posting regularly video solutions of each contest from Codeforces , codechef and leetcode .
your explantion is awesome.make more videos like this
Thanks , From now onwards i'll be posting regularly video solutions of each contest from Codeforces , Codechef and Leetcode so make sure to subscribe us :) .
Very nice explanation sir, Thank you!
Thanks , From now onwards i'll be posting regularly video solutions of each contest from Codeforces , codechef and leetcode so make sure to subscribe us :) .
id apki kya hai ?
amazing
Thanks :) . if you liked it do subscribe us for upcoming Post contest Discussion videos .
this was by far the best explanation with examples.
Thanks :) . its great that you liked it .
very well explained. keep it up. Waiting for more
Thanks . will definitely upload a lot's video. Do subscribe us :).
Good job sir. Great Explanation sir 👍
Thanks :) , i am happy that you liked it ...
I was not able to understand the question, but your explanation made it clear :) Keep uploading...
Thanks ! I am super happy that you liked it :) . Subscribe for upcoming PCD.
@@ajitkushwaha3101 Subscribed.
Sir please help above code
Sir please please help me with this for fifth question giving run time error I do not know string hashing so i use 3 vectors that store prefix strting suffix string and the current string with length n/2. Giving. Run time error on 5 th hidden test case . Took more than 5 hour #include <bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--){ string s; cin>>s; int ans=0; int n=s.length(); if(n%2!=0) ans=0; else{ int x=n/2; vector<string>prefix(n),suffix(n),mera(n); for(int i=0;i<n;i++){ if(i-1>=0) prefix[i]=prefix[i-1]+s[i]; else prefix[i]=s[0]; } for(int i=n-1;i>=0;i--){ if(i<n-1) suffix[i]=s[i]+suffix[i+1]; else suffix[i]=s[n-1]; } string temp=""; for(int i=0;i<x;i++){ temp+=s[i]; } for(int i=0;i<n;i++){ mera[i]=temp; temp.erase(0,1); if(i+x<n) temp+=s[i+x]; else break; } for(int i=0;i<n;i++){ string p="",q="",r=""; if(i>0) p=prefix[i-1]; q=mera[i]; if(i+x<n) r=suffix[i+x]; if(p.length()>x) break; if(p+q+r==s && p+r==q) ans++; } } cout<<ans<<endl; } return 0; }
For youtube shorts video length can be at max 60 sec . so it wasn't possible for me to explain how to make changes according to your requirement into it. if you want i can surely make a long video explaining everything about this library :)
Good explanation Sir👍
Acha sir 😏...
isnt it similar to if to make a, b equal then we need to take the diff: (a-b) and use this to do like a/(a-b) = b/(a-b) like this we can form a palindrome?
I can't understand like what exactly you are trying say but see to make a = b . We can only do this when If(a%k == b%k) then (a-b) will always be divisible with k . And if difference is divisible by k so we just need to add this difference to min(a,b) Now difference/k will be no. Of operations to make them equal that's it.
Also one more thing to make a = b I can only do a += k*times. Considering (a<b). Try observing all testcase you will get the all hints . Also if you feel what you are saying is correct do check with few testcase maybe you will get some idea
To make it this more interesting i am planning to share the new things that i'll learn everyday while building this project :)
Your english is really smooth and clear and you explained the project very well. Noice brother keep it up.
Thanks , it really means a lot .
✌️💡🔥
From tomorrow the actual coding part will start :) . Sorry for bad video editing skills :(
Best 🎉✌️
great explanation bro, really helpful and beautiful solution
Thanks , i am happy that you liked it :)
Sorry for bad internet connection :( if you have any doubts then you can simply ask :(
suuupper creative video
If you have any doubts you can simply ask here :)
👏✌️
If you have any doubt with the explanation you can simply ask me here :) 🦸♀
simple and sorted 🤐