Hello Codeforces community,
I've been working hard to reach the Specialist rank, but I feel like I'm hitting a wall. I've put in quite a bit of effort practicing problems and studying algorithms, yet progress is slow. So, I thought I'd reach out to all of you for advice!
Here’s a bit about what I’ve been doing so far:
. Practicing Basics: I’ve been solving a mix of 1400 and 1500 rating problems to strengthen my understanding of basic algorithms and data structures. . Focused Practice: I’m trying to work on specific areas like sorting, binary search, and dynamic programming, but sometimes it’s hard to know which topics to prioritize. . Time Pressure: In contests, I struggle to solve problems fast enough to get a good rating boost. Questions for You . How did you break through to the Specialist rank? Was there a specific approach, topic, or routine that helped? . Any tips for improving speed and accuracy under contest conditions? . Are there particular topics you found crucial at this stage? I don’t want to waste time on areas that won’t help me grow as much. Thank you in advance for any insights or advice you might have. Looking forward to learning from all of your experiences!
Happy coding!
help me too
Solve problems consistently, read editorials, upsolve after contests. I think that is what you need to do to reach Specialist!
to code fast: learn touch typing
to code accurately: code slowly on harder/longer codes
struggle on time pressure: give all contests regularly
main topics: binary search, two pointers, sort() function, greedy, math, implementation, dp(recommended but not holding you back), graph visualization and dfs algo
there is a variety of two pointer that i found very helpful, in any array, suppose you consider a range(l,r) satisfying certain property and then jump to (r+1,..) , .. then i do following ~~~~~ //C++ int l = 0, r = 1;
while(l < n) {
if (l not satisfies) {l++;r=l+1;continue;} if (r satisfies) {r++;continue;} // do something on [l,r) (including l but excluding r) l = r;r++;} ~~~~~