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
Knight move#4021
Medium
Cycling#4024
Very hard
Edge Case#4026
Medium
Brackets#4045
Very hard
Melody#4049
Very hard
Grasshopper#4051
Very easy
Traffic Rules at LKS#4052
Very easy
Three ones in a row#4054
Very easy
Calculator#4055
Very easy
Smooth numbers#4056
Very easy
Cinema#4057
Hard
Knight's Move - 2#4058
Medium
Electronic Hunting#4067
Very hard
Recursive Sequence#4075
Very easy
Corporation Salary#4077
Very easy
Longest path#4087
Very easy
Ultimate Device#4095
Medium
Warp Speed II#4096
Medium
Chemist's vows#4130
Very easy