why in prob D they are calling it a binary search? in theory we are reducing the size by 1 and not by half and also the thing we are searching on is not sorted?
D problem is very op , i also think binary search on answer but reverse way for each i,j find l this not easy but your thought process for each l find any i,j
Sir How do you calclute that n*sqrt(N) in problem C solution would pass? even i have same approach but thought tha implementing it would result in a TLE😥😥😥😥
Thank you so much everyone, I am really grateful for all the good wishes ❤️
@Sai Jithesh go to his submission on cf to get that !
Master 🥳🔥🔥
Thankyou I was not able to formulate the dp formula for E you explained it very well
please make vedio on Crt, refering to the C problem of good bye 2022 round
Why is the count array in problem C is of size 5*n+1? How did you figure this out?
even 2*n+1 will do fine
try it yourself
Master 🥳🥳🔥🔥
So you are his Fastio right?
There's something special about your speaking and explanation man. Hats off!
Master Sharma, what (who) is DIVYA?
@@Harisamsharma i think it is related to divya shakti ( "divine," "fate" or "fortune).
Love u bud
Heyy can u make a video on explaining your template it would be very helpful
you deserve more subscriber,
cool explanation man!
Congratulations sir!
And thank you for the advice at the starting of the video :)
In the ranting part he concluded by saying, "Karm krte jao, fal ki chinta mat kro ." Hare Krishna
Great job!
Congratulation vaiya for becoming master
🙇🙇🙇🙇🙇
I could solve only till c
I couldn't understand the qn D
Congratulations. Please keep providing the editorial videos. It helps a lot 🙏
Which website you mentioned for placement interview preparation? I can not able to listen properly after brain word. ?
Congrats for the master. Can we now expect a board while explanation? :-)
Congratulations for becoming master. You made it!
Congratulations! And I am also wondering whats the extension you used to show predicted score delta🤔
can anyone please explain me the inverse concept in problem B ;( and why we are doing there ??
you can solve it without inverse modulo you can see my tutorial ruclips.net/video/djiqZOQj7u4/видео.html
yes sir you are back
Cheers to the moment 🥂🍻
Master orz
Master 🥳🥳🥳🥳. Congratulations bhaiya.
Please make more content of competitive programming for us juniors
Congratulations Sharma Bhai, Mastery krli abb toh CF pe😃😂
Master sharmaharisam it is.👏
why in prob D they are calling it a binary search? in theory we are reducing the size by 1 and not by half and also the thing we are searching on is not sorted?
Congratulations sir !!! Who's DIVYA !! 😳😳
D problem is very op , i also think binary search on answer but reverse way for each i,j find l this not easy but your thought process for each l find any i,j
In problem C why map is giving TLE ?
Awesome job! I love your videos and am so excited for you to reach this next level!
sir videos banaiye apki explanation ke aage tourist bhi fail hai
thanks a lot sir,,, Congratulations for being Master
Congratulations , inspiration to many like us :)
Explanation always class as usual
Congrats 🎉 master
congratulations.
Sir How do you calclute that n*sqrt(N) in problem C solution would pass? even i have same approach but thought tha implementing it would result in a TLE😥😥😥😥
N*sqrt(N) generally works when N is of the order of 10^5
@@Harisamsharma 👍👍
king is back
In C you have a condition if(xorr^a[i] < 5*n) for is that for I dont understand the reason for that
yeah same here...can u explain?
@@probro8031 a[i]
How did you clear the snowflakes in dark mode?
Thanks for the video editorial.
look at the first hack here: codeforces.com/blog/entry/110619
Contrast increase krdo
@@Harisamsharma Yeah i read that blog later and used the first hack only. Thanks :)
G.O.A.T 🐐