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.

Задачи

Dog, traitor and cable#11079

Многу лесно

Big task#11095

Лесно

Cactus#11105

Многу тешко

The number of paths#11114

Многу лесно

Electronic lock#11119

Многу лесно

Lemurs rearrangement#11124

Многу тешко

First to Solve#11137

Многу тешко

Fruit Feast#11161

Средно

Meeting Time (Silver)#11191

Многу лесно

Grass Cownoisseur#11194

Многу тешко

Minimum Cost Paths#11205

Многу тешко

Just Green Enough#11212

Многу тешко

Count the Cows#11215

Многу тешко

Counting Graphs#11218

Многу тешко

1326-1350 од 1459