Hello Codeforces Community,
I hope you are all doing well. I have been participating in competitive programming for a while and have gained a basic understanding of several data structures and algorithms, including binary trees, basic graphs, DFS/BFS, bit manipulation, recursion, and sliding window. However, I am still striving to achieve the Specialist rank, and I am curious to know if I need to deepen my knowledge of DSA or focus on other areas to reach my goal.
My Current Knowledge:
Binary Trees: Understanding of basic operations like traversal (in-order, pre-order, post-order) and insertion. Graphs: Familiar with basic concepts such as DFS and BFS. Bit Manipulation: Basic operations like AND, OR, XOR, and bit shifting. Other Algorithms: Basics of recursion and sliding window, sorting algorithms, searching algorithms (binary search), and some basic dynamic programming problems.
My Questions to the Community:
Should I learn more DSA or techniques, or should I revise what I already know to achieve the Specialist rank? (Actually, my aim is not CP related.)
I would greatly appreciate any advice, suggestions, or insights from the community. Your guidance will help me better structure my learning path and hopefully achieve the Specialist rank soon.
Thank you in advance for your support!
Happy coding!








I don't think you really need many techniques to reach specialist. Basic observations (to use greedy) and implementation skills are usually enough to solve div 2 C, and practicing a bit will get you to specialist.
Get familiar with STL, such as map, set, queue, etc. I think it is enough to reach specialists. Div2 C is mostly implementation with some observation.
STOP!! solving 800's now focus on 1200-1600. ALL THE BEST!!
just give virtual contests, improve your speed ig.