Browse Problems 
Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 # | ||