I want to be able to solve most of graph/tree problems below 2000 rating as soon as possible. How should I practice and What should I practice? I know basic DSU/bfs/dfs/dijikstra but almost no idea about advance concepts (Tarzan/Euler/other algorithms) I am able to solve 1500-1600 rated Graph ques most of the time but for 1700+ rating problems probablity of me solving question is almost zero. I want to know what is actually this wall and how can I cross it ?Any tips for meee ;>
