Блог пользователя New_Beginning

Автор New_Beginning, история, 4 года назад, По-английски

Hello Codeforces!

(I don't want my friends to see me that's why I created this account).

Till now I am able to solve basic cp problems on binary search, two pointer,constructive algorithms, implementation and sometimes greedy problems on codeforces. By basic I mean upto tag 1300. However when it comes to tags like DP, tree, graph (which requires knowledge of recursion) I falter. I thought that the EDU section on codeforces will come up with recursion topic but I guess it has started with DSU after string suffix and binary search. The EDU section has helped me a lot in solving problems.

I also read few chapters of CSES Competitive Programming handbook by Antti Laaksonen. (suggested by pllk) It is a great book but it does not cover recursion in detail. (Chapter 5 deals with recursion little bit)

Please suggest some resources so that I can learn this topic. And hopefully can overcome my fear. :)

Thanks in advance! :)

  • Проголосовать: нравится
  • -16
  • Проголосовать: не нравится

»
4 года назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

I was in the same situation like yourselves some time before.What I did was some basic problems from geeksforgeeks , and saw that there is a pattern in each of them. What actually helped me is the visualisaation of each problem which involved recursion. I recommend you to start tracing it for like 10-20 problems to get a feel of it. After you get the visualisation, only thing left is implementing it in a number of ways on a lot of problems. for that you could write your own solution and try comparing different solutions of that problem . Trust me , you will learn it . It took me 3 days to gain confidence. In that span of time , I solved problems from GFG, hackerrank , hackerearth, UVA online judge, leetcode, interviewbit, codeforces etc. You get what i am trying to say. Hunt problems of recursion and kill them. xD Recursion will become one of your strong topic in no time. Best of luck :)