Dynamic programming
Problems on dynamic programming, including counting paths in a grid, the longest increasing and longest common subsequences, edit distance, knapsack, coin change, dynamic programming on intervals, trees, digits and subsets, and games solved by computing winning states.
The introduction in the Dynamic programming section works through the method step by step. Narrower problem sets are under Knapsack, Bitmasks and Dynamic programming optimization.
Problems
ATM#8303
Hard
Fun function#8304
Very easy
Lift Problems#8330
Very easy
Interesting Integers#8345
Very easy
Sum of cubes#8354
Medium
Palindrome#8359
Easy
Turtle#8360
Medium
Casino#8496
Very hard
Sequence#8500
Easy
Palindrome#8505
Hard
Game#8506
Medium
Triangle#8507
Easy
Jam#8509
Very hard
Game#8552
Easy
Khans#8557
Easy
Crypto#8562
Easy
Towers#8566
Easy
XOR-paths#8574
Easy
Boss#8576
Hard
Exams#8584
Easy