nafeeur10's blog

By nafeeur10, 9 years ago, In English

I'm learning dynamic Programming (DP). I have already learned 0-1 Knapsack, Coin Change and LIS. I want to solve some problems on these categories. Please suggest me some problems of codeforces those are solvable by these 3 algorithms.

  • Vote: I like it
  • +11
  • Vote: I do not like it

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

If you just want to solve Codeforces problems then go through this [ btw if there is no tag for unsolve problems then click show tag for unsolve problems just below your profile info ] And for find out problems of any category you can check this

Good Luck :)

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

A2 Online Judge contains different categories of problem, although not all the problems are on Codeforces (mostly on SPOJ and UVa):

0/1 Knapsack : here

Coin Change : here

LIS : here

The problems are sorted by their difficulties which are shown on the rightmost column, so you may want to solve the problems from the easiest one.

Hope this can help you :)

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

In this judge online you can find several problems about dp, http://coj.uci.cu/24h/problems.xhtml, plus you can categorize