Please add the following problem to your problems list:
0/1 Knapsack Problem

It is one of the most fundamental (HARD) questions under the 'Dynamic Programming' category.

thanks in advance!