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
Mobile#2682
Very easy
SumOfPowers#2687
Hard
Platforms#2688
Easy
Text Editor#2689
Easy
Danger of explosion#2707
Very easy
Pascal's triangle#2710
Very easy
Wimbledon#2726
Medium
Cipher#2728
Hard
Ice Game#2737
Very hard
Jumps#2738
Easy
WoW#2741
Very hard
Pills#2755
Medium
Robot Navigation#2756
Very easy
Wealthy Family#2759
Very easy
Nesting Dolls#2770
Very easy
Like 3#2771
Easy
Stones#2787
Easy
Checkpoint#2821
Easy
Squished Status#2823
Very easy
Bachelor pursuing#2846
Very easy