LearnToCP
Sign in

DP problems

Here is a list of recommended elementary DP problems to solve:

Max Matrix sum: http://learntocp.com/en/Problems/max-matrix-sum

Robber Problem: http://learntocp.com/en/Problems/robber

Longest Common Subsequence (LCS) : http://learntocp.com/en/Problems/lcs

Longest Increasing Subsequence (LIS) : http://learntocp.com/en/Problems/lis

Longest Increasing Subsequence II : http://learntocp.com/en/Problems/lis-2

Knapsack Problem : http://learntocp.com/en/Problems/knapsack

Navigation
HomeRoadmapAbout UsProblems
Theory
Basics
Data types and IOC++ syntaxModuloVectorsMatricesTime Complexity
Sorting
SortingCounting sort
Optimization Techniques I
Two PointersSum of numbers 1 to nPrefix sumBinary Search
Binary Numbers
Binary NumbersNumbers in codeBitwise Operations
Math
Binary Exponentiation
Dynamic Programming
About DPDP problems