I am a newbie for algorithms and data structures. I have recently started taking part in codeforms and spages etc. To solve the questions, I need to study DP, greedy algorithms, graph algorithms, data structures. What should be my strategy for study or sequence and what data structure do I need for competitive programming?
There should not be any "optimum" sequence in all this about understanding the subject. Since two people can not learn at the same speed, nothing should be like "optimum" sequence but it is good to learn the basic methods of each subject.
There are so many tutorials that show the most fundamental thing in any topic. Just like YouTube covers most graph problems, even the DP and so can be found. Especially there is a lot you can learn.
On the other hand, you will not learn anything, if you do not have to think for yourself. So it is necessary to solve such puzzles I would recommend (especially for the DP) just check the "Problem Set" link on the site and see dynamic programming.
Comments
Post a Comment