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

Hello brother

Make a playlist

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

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

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

good explanation

Awesome bro, keep up the good work

great explaination bro

how to get the idea for this kind of questions?

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") << ' ';

very good

your explantion is awesome.make more videos like this

Very nice explanation sir, Thank you!

id apki kya hai ?

amazing

this was by far the best explanation with examples.

very well explained. keep it up. Waiting for more

Good job sir. Great Explanation sir 👍

I was not able to understand the question, but your explanation made it clear :) Keep uploading...

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👍

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?

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.

✌️💡🔥

From tomorrow the actual coding part will start :) . Sorry for bad video editing skills :(

Best 🎉✌️

great explanation bro, really helpful and beautiful solution

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 🤐