Regarding competitive programming

#1

Shall I complete topics like STL, greedy algorithms, recursion, trees, hashing, DP, heaps etc… before diving into div2 contests ( not div3)
in CP ?

#2

hello @prerak_semwal

no , div2 A,B are mostly implementation(sometimes basic maths) problems so u can solve them without even knowing the above mentioned concepts.

div2 C -> most of the time it is greedy or constructive algorithm based(sometimes concepts like dp , number theory get asked), and to the tackle that problem all u need is good observational and implementation skills.

divD onwards dsa get asked.
i would recommend irrespective of what u know ,just start giving contests and uplsolve after contest(read ditorials and try to code on ur own). gradually u will improve .

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.