Browse Problems Login
Online Judge
| My uHunt with Virtual Contest Service |
| Browse Problems |
| Quick access, info and search |
| Problemsetters' Credits |
| Live Rankings |
| Site Statistics |
| Contests |
| Electronic Board |
| Additional Information |
| Other Links |
With the collaboration of
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Dynamic Programming
| Title | Total Submissions / Solving % | Total Users / Solving % | |||
|
Longest Increasing Subsequence (LIS) - Classical | ||||
|
|
Coin Change - Classical | ||||
|
|
Maximum Sum | ||||
|
|
0-1 Knapsack - Classical | ||||
|
|
Non Classical (medium difficulty) | ||||
|
|
DP + Bitmasks | ||||
|
|
DP on 'Graph Problem' | ||||
|
|
DP on Tree | ||||
| << Start < Prev Next > End >> | ||
| Display # | ||