KingOfAlgorithms's blog

By KingOfAlgorithms, 9 years ago, In English

Hi I am From Syr and I am New at programming and I've Trained on some subjects like : graph , dfs, bfs , dijkstra , and more . but I dont Now What Is the best Way to be good at Dynamic Programming can you help me and I will be thankful .......

Tags dp
| Write comment?
»
9 years ago, # |
Rev. 3   Vote: I like it +13 Vote: I do not like it

The best way to be good at some topic is to solve a lot of problems of that topic.

Update: You can try to solve some problems under DP tag from timus or lightoj. I like those problems very much!

»
9 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

I'm not expert but I can say that the best way to be good at dynamic is solving lots of problems and in codeforces there are lots of problems about dynamic programming

  • »
    »
    9 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    You are technically an expert ;)

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

if you don't now .. join liberland

  • »
    »
    9 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    yeeeh join liberland :) :) :)

»
9 years ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

I learned by this method first we write complete search with recursion and convert to memorization. I think this method is good for beginners

»
9 years ago, # |
  Vote: I like it +4 Vote: I do not like it

I think this is a good DP introduction. There are videos + nice explanation

http://people.cs.clemson.edu/~bcdean/dp_practice/

  • »
    »
    9 years ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    hmm.. good classical problems about DP , do you know a similar site (not necessarly the same author) that contains classical problems of other topics (graphs, geometry etc ..)

    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      a2oj.com has a nice collection of problems on all programming related topics along with their difficulty levels.