Dynamic programming 0/49

Knapsack DP: capacity tables and grid paths · 1 of 2

Grid DP

Count the paths through a grid, find the cheapest path and the largest square of 1s, with one state per cell and a transition from the neighbouring cells.

3,023 words · 14 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 4