@@itzzRaghav I think 2 can also be solved by starting from end in the permutation. if we fill the permutation array from the end we always know the mex is n initially we can find the last element of permutation and now if it is less than the curr mex update the mex and find the permutation again with the formula mex-an
I am a school student. I missed the notification of free slot. Is there one slot available for me pls sir. I want to explore this field bit my parents are not ready to purchase course as they feel this is not for school students. I have explored whole RUclips about cp and i feel that this is for me. Pls do help me sir Tq
@@Tejaswi-xd4re There are many other resources available online for free. Try reading guide to competitive programming it covers all the topics covered in the course.
@@itzzRaghav Sir, have you used set in C1 to improve time complexity ? because we're checking whether neighbours exists or not. Checking through the vector is of linear complexity & find() or count() operation in set are of logarithmic complexity.
Has he used set in C1 to improve complexity because we're checking whether neighbours exists or not. Checking through the vector is of linear complexity & find() or count() operation in set are of logarithmic complexity ??
@@itzzRaghav Hello bhaiya , I am facing trouble in div 2bs. I am able to solve div2as consistently but i am not able to think how to solve div2bs. It is been 6-8 months now i am still not able to think. What should i do?
Wanna ask 1:1 doubts to Raghav Bhaiya? Enroll with us now at www.tle-eliminators.com
awesome explanations
thank you so much raghav bhaiya
You're welcome
What's the approx rating of 'B', "clist" says its 1000-1100 and it's hard believe that
I think it can be done 1000-1100
@@itzzRaghav OK 👍
@@itzzRaghav I think 2 can also be solved by starting from end in the permutation.
if we fill the permutation array from the end we always know the mex is n initially we can find the last element of permutation and now if it is less than the curr mex update the mex and find the permutation again with the formula mex-an
What is "clist" ?
do you mean it can be solved by who are less than that?
I am a school student.
I missed the notification of free slot.
Is there one slot available for me pls sir.
I want to explore this field bit my parents are not ready to purchase course as they feel this is not for school students.
I have explored whole RUclips about cp and i feel that this is for me.
Pls do help me sir
Tq
Bro you would rock in college if you do now
Tq bro
But I need that course
@@Tejaswi-xd4re There are many other resources available online for free. Try reading guide to competitive programming it covers all the topics covered in the course.
problem with your audio only one ear phone working
I think it's a fault with zoom, during live class the audio was fine.
This kind of issue happened with other mentor also.
why %n?
where?
@@itzzRaghav in problem c1 ,(V[i] + 1 )%n
@@Haxaze When V[i] = n - 1, what is the next vertex (considering that vertices are labelled from 0 to n - 1)
@@itzzRaghav Sir, have you used set in C1 to improve time complexity ? because we're checking whether neighbours exists or not. Checking through the vector is of linear complexity & find() or count() operation in set are of logarithmic complexity.
@@priyanshkumar17
if(a[x]-a[1] == n-2){
count++;
}
for (int i=1;i
I Think Raghav Sir love Sets 🥧🥧
Expected Rating of C1..... ?
Has he used set in C1 to improve complexity because we're checking whether neighbours exists or not. Checking through the vector is of linear complexity & find() or count() operation in set are of logarithmic complexity ??
you got it right xD
(btw we could have used binary search instead of set)
@@itzzRaghav sir have you replied to my earlier comment or to @Now_I_am_all_fired_up ?
@@priyanshkumar17 Actually I replied to @Now_I_am_all_fired_up.
But what you are saying is also correct.
Please fill the Feedback form for PCD: forms.gle/d53MMsrxrrLJRTv7A
please change your mic
Yes I will change but it might take some time 🥲
@@itzzRaghav Hello bhaiya , I am facing trouble in div 2bs. I am able to solve div2as consistently but i am not able to think how to solve div2bs. It is been 6-8 months now i am still not able to think. What should i do?
your cf pls
my username on Codeforces - itzzRaghav
Mic tu lelo 😴
Idk what problem happened here, when I was taking the class, students said that voice is coming good. But here the voice isn't coming well 🥲
@@itzzRaghav Bro ur voice only coming in the left side ear piece like fr.... Maybe the editor cooking something here😷
@@mrcow6531 The problem is probably related to zoom, it happened with Ankit sir as well.