TLE 12.0 - our Competitive Programming course TLE 12.0 is live! Enrol now at www.tle-eliminators.com/login?referralCode=60B8E114 Please fill the Feedback form for PCD: forms.gle/RhaCWWudRHjs9uCHA
@@namangirdhar-e1t helping is not always that u will gain rating see as far as I was pupil before the course but it fluctuates between newbie and pupil now I am stable pupil and moving toward speciallist , now I don't have much rating gain but my knowledge increases a lot and rating gain depends on your IQ,sharpness and logical thinking the course will give u path,guidence and knowledge which is 50% and the reaming 50% is your efforts, thinking etc and one more thing by just doing lev 3 it's difficult to be specialist because for that u just not need to solve first 3 u need to solve them sooo quickly in div 2 or solve first 4 and for that practice D which will again take time and it tooks time to improve
TLE 12.0 - our Competitive Programming course TLE 12.0 is live!
Enrol now at www.tle-eliminators.com/login?referralCode=60B8E114
Please fill the Feedback form for PCD: forms.gle/RhaCWWudRHjs9uCHA
Gaurish the god , best teacher on TLE eliminators learn lots of things from him in lev 3 now eager to learn in lev 4
did level 3 help you? if yes, what was your rating gain?
@@namangirdhar-e1t helping is not always that u will gain rating see as far as I was pupil before the course but it fluctuates between newbie and pupil now I am stable pupil and moving toward speciallist , now I don't have much rating gain but my knowledge increases a lot and rating gain depends on your IQ,sharpness and logical thinking the course will give u path,guidence and knowledge which is 50% and the reaming 50% is your efforts, thinking etc and one more thing by just doing lev 3 it's difficult to be specialist because for that u just not need to solve first 3 u need to solve them sooo quickly in div 2 or solve first 4 and for that practice D which will again take time and it tooks time to improve
@@Noob_Coder1234 how long to reach stable pupil provided I gave 17 contests and current rating is (820)?
Comefrom CF blog
can you please contniue to solve codechef daily contest questions
Is there a way to solve this problem without segment trees?
Gaurish sir i implemented the same solution as you but got wrong answer on test 13
i realised that my mistake was to take max=-2e5 after i took -1e17 it worked
@@invincible9240i did the same haha
Can anyone plz find out the time complexity of the 4th solution!?
O(nlogn)
It's just nlog(n), roughly deleting and inserting n times some constant c or k or whatever. overall nlog(n).
Please explain the question before discussing solution
i missed both contests due exams. will try them first then watch this