Cf tracker would be great help here

thank you so much bro

Thanks bro

Brother please upload more editorials.

Can you make a video on stress testing?

can i get your discord ,i need to contact youu personally

Nice video bro!!

Awesome editorialss!!

keep uploading editorial bro ,those extra suggestion and observation are very helpful

Hi , please give me practice advice. I can't even solve a quesions. 800 questions are too easy. Should i solve the 800 problems solved by less number of people. Also how to practice to reach specialist ( random practice & topic wise practice) ? Please reply

E well explained 👏 thank you

Try uploading video solutions of code chef contests as well ❤

Keep uploading editorial videos...they are very very helpful ❤❤

Bro how to read problems

Please share your hand written notes of competitive programming

Bhai I literally can't understand long questions how to improve

The idea for second problem isn't very hard to reach. But the implementation is the challenging part. There was zero chance I'd been able to do it in contest when my DP is pretty weak, it wouldn't even click to use that jee formula here to make the dp.

Subscribed. I'm on my way to become Expert.

from where and how do you choose problems to practice? to become specialist/expert

thanks bro the amazing content

Excellent video looking forward to more thank you

Can u alsdo codeforces codechef

U earned a new subscriber ❤

Fabulous observation in 3rd question. Great explanation, thanks

Hello Aniket! Can you make a tutorial on how to improve in competitive programming fast(effective practice )

For the first one i was also using this approach but it kept overflowing then i spent my one hour debugging this instead of solving the other Then in the last 30 min went to 2nd and solved it in 15 minutes with 1 remain unsolved 🥲 This limit approach is nice btw to prevent overflow, never saw one before.

Extension name?

That's actually a very good technique

11:37 u were saying triangle instead of rectangle 😅 explanation of 2nd is much clearer thanks

finally bro is back

I didn't realize that n * k would still lie under 1e5(rather than O(n2)), because both the loops contribute only n, as if K increases the number of partitions decrease as the elements per partition would be n / k. Thanks man well explained.

Long time No see bro !!. Glad to see you again

Thank you for the editorials!! Loved it.

Go Aniket🔥🔥 Quality content at its peak

so u r learning and applying in codeforces and codechef platforms daily

This is great trick.. but u forgot to mention how long should one give time to solve it and then when to lookup for editorials

Brother plz share your template

Thanks bro very helpful

How to choose problems for practice?? Please tell

How to build logic properly ?

ty ankit

Sir contest men questions time par solve nahi ho paate , pehla hojata hai par dusra men kabhi time limit kabhi partially correct on leetcode what to so

Nowadays doing 3 does not get you past newbie due to ofc …. 😒

Thanks Brother. I will try this.

Nice sir

i am wondering that i need what math grade to solve problem on codeforce

very helpful

Awesome bro

Thanks a lot for the advice!

brother can you make a video on how can freshers who are just begining can speed run competetivie programming from 0 .