A-F Codechef Starters 131 Editorials Solutions | T-Perm | Encrypt Value | K-Closeness Dice Deception
Vložit
- čas přidán 28. 07. 2024
- Subscribe to the channel for Amazing Coding and Competitive Programming Content.
Problem A: coding75.com/dsa-cp/codechef/...
Problem B: coding75.com/dsa-cp/codechef/...
Problem C: coding75.com/dsa-cp/codechef/...
Problem D: coding75.com/dsa-cp/codechef/...
Problem E: coding75.com/dsa-cp/codechef/...
Problem F: coding75.com/dsa-cp/codechef/...
🚀 Join Telegram for Post Contest Discussions, Coding Meets, and Important Updates, Join a Community of over 20,000+ Coders: t.me/cpabhinav
📌 Follow me on Instagram for Regular Updates: / iammabhinav
📌 Join my family of 40K+ on Linkedin: / abhinavawasthi01
📌 Whatsapp Channel: whatsapp.com/channel/0029Va55...
👉🏻 Coding Profiles
My Codeforces: codeforces.com/profile/abhina...
My Codechef: www.codechef.com/users/abhina...
My Leetcode: leetcode.com/abhinavawasthi/
👉🏻 Connect with Me
LinkTree- linktr.ee/abhinavawasthi
My LinkedIn- / abhinavawasthi01
My Instagram- / iammabhinav
My Facebook- / awasthi.abhinav.3
My Twitter- / call_me_abhinav
Coding Blogs- abhinavawasthi.code.blog/
coding
programming
competitive programming
software developer
software engineer
interview preparation
interview experience
dsa
Codechef Starters 131 Editorials
Codechef Starters 131
Codechef Starters 131 Solutions
T-Perm
T-Perm codechef solutions
T-Perm codechef
T-Perm codechef editorial
T-Perm solution
T-Perm editorial
Encrypt Value codechef editorial
Encrypt Value codechef
Encrypt Value
Encrypt Value editorial
Encrypt Value codechef solution
Encrypt Value solution
K-Closeness
K-Closeness codechef
K-Closeness codechef solution
K-Closeness codechef editorial
K-Closeness solution
K-Closeness editorial
Dice Deception
Dice Deception solution
Dice Deception editorial
Dice Deception codechef solution
Dice Deception codechef editorial
Dice Deception codechef
Gotta Catch Em All codechef
Gotta Catch Em All
Gotta Catch Em All codechef solution
Gotta Catch Em All solution
Gotta Catch Em All codechef editorial
Gotta Catch Em All editorial
Remaining Neighborhoods
Remaining Neighborhoods codechef solution
Remaining Neighborhoods codechef
Remaining Neighborhoods solution
Remaining Neighborhoods codechef solution
00:00 Introduction
00:50 Remaining Neighborhoods
01:33 Gotta Catch Em All
05:00 Dice Deception
11:43 K-Closeness
25:10 T-Perm
37:15 Outro
problem Closeness wasn't clear at all till the last second until you said that its like adding 4 or k to all the numbers behind. so it's like when adding the k to the current element this element will become the new max and all the element before it we will also assume that we added k to them but we know for sure that the current element is the new max because the array is sorted and we know for sure that the second element after the current element is the new min because we didn't add k to it
Sorry for this, my explanation was little fast
Btw we had good discussion on this in our telegram group, you can join that
apko dekh ke muje lga ke abhinav ne clean shave krwali ha 😂😂😂😂 btw love your content from Pakistan.
Bhai prank tha, mai Abhinav hi hun 😂
Love from India ❤️
thannkss
Welcome
34:16 Bhaiya if n is a good number how 2* n is a good number? Take the case of 6 , 6 is a good number because it can be represented as (20) to the base 3 but 12 which is the double of 6 is not a good number its representation will be (110) to the base 3
Bro, but in this case n+1 is a good number, so it will take that first
Then for a number whose n+1 is for good, then if n is good 2n will also be good
But here for n=6, 7 is good
@@AbhinavAwasthi Thanks
You have explain the code but i didn't understand i am talking about problem D you sometimes say something and later another please make me why you did that in your code???
So sorry, I can understand the explanation was little fast
Will improve in next videos
Thank you sir for the solutions but sir how to make intuition to solve these questions like T-perm or other
Sure, thanks a lot
helpfull
Thanks
Can you say why you are adding the 4 for finding the difference
I am assuming the value of k as 4
New look is spicy😩
😂
Bhaiya LC biweekly ka video dalo 27-04-24 vala ke 3rd and 4th ke ,,i
Done, uploaded
Bro you looks exactly same as abhinav 😮😮
I am Abhinav only 😂
Aap dono to similar lagte ho judwa bhai ho kya??
Bhai Mai hun 😂
explain the question 1st and then go to the ans
Sure, thanks for your suggestion
hi abhishek sirrr😆
Hello
carbon copy ho kya sir aap?
Bhai Mai hi hun 😂
Bhai je kya kar liya
Krna pada bhai
why it is giving WA:-
ll mod=1e9+7;
void solve() {
ll n;
cin >> n;
v(n);
sort(all(v));
ll s=v[0];
for(int i=1;i
You can't just take max, value of a can be very large after multipying
Yaa got it thank you 🙏
i am not able to get the test case where it is failing T Perm-
void solve() {
ll n;
cin >> n;
int j=-1;
vectorb(n+1);
for(int i=1;i
Please help me to find the mistake in this
Hello sir arif this side ,
i have solved by same logic see my approach of k-closeness
for(int i=0;i
Great!
MOD=???
I have taken the mod also, check code
Cheating bohot horahai hai yaar while contest k-closeness only 8% logo ne kiya tha, contents khatam hone tak almost 50% logo ne karliya😢
#include
#define ll long long int
#define yes "YES"
#define no "NO"
#define nl "
"
using namespace std;
void solve()
{
int n;
cin>>n;
vectora(n);
for(int i=0; i>a[i];
}
sort(a.begin(),a.end());
ll mod=1e9+7;
ll ans=a[0];
for(int i=1;i
@@pullobdebnath7031 read your if else, you're adding in both cases
@@the_shridhar agree bro..2 questions mere 9 mins me ho gye tb meri rank 300 something thi...contest over hone tk 2700 ho gyi😢😢
Explaination are not upto the mark....
Will try to improve
What is wrong with this code? problem-> Encrypt Value
int n;
cin>>n;
deque v(n),pre(n),mul(n);
for(int i=0;i>v[i];
}
sort(all(v));
for(int i=0;i=0;i--){
mul[i]=v[i];
if(i
Have your tried dry run?
@@AbhinavAwasthi yes and i dont see the error here too. I have just taken prefix and suffix multiplication and start iterating from first element of prefix because 1st element has to be there no matter what. Then i have moved till n-2 and just checked the last element individually
@@AbhinavAwasthi can anyone help me find the mistake here? Will be glad to understand it
lolll
😂
Next time... exam ke time pe video daalna vro
Exam time kaise daale bhai
@@AbhinavAwasthi jaldi karke text hi daaldo bhai
bakwas explanation for k closeness
I can understand, sorry for this quick video, will improve in next videos