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 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
Max 1D Range Sum | |||||
|
|
Max 2D Range Sum | |||||
|
|
Longest Increasing Subsequence (LIS) | |||||
|
|
0-1 Knapsack (Subset Sum) | |||||
|
|
Coin Change (CC) | |||||
|
|
Traveling Salesman Problem (TSP) | |||||
|
|
Non Classical (The Easier Ones) | |||||
| << Start < Prev Next > End >> | ||
| Display # | ||