DP on a Grid
Counting paths and finding cheapest routes, where the recurrence is visible in the picture.
0 of 28 answered
Start here
Blocking a cell
Foundation
- Not triedBlocking a cellFoundation
- Not triedHow Many Ways AcrossFoundation
- Not triedPaths With a Diagonal StepFoundation
- Not triedThe edges of the gridFoundation
- Not triedWhere a cell can be reached fromFoundation
- Not triedWhich cells a grid cell readsFoundation
- Not triedCheapest Way AcrossCore
- Not triedCount the Squares of OnesCore
- Not triedCounting Every Square of OnesCore
- Not triedFalling Without Repeating a ColumnCore
- Not triedFrom counting to optimisingCore
- Not triedHow Many Ways Across a Blocked GridCore
- Not triedKeeping one rowCore
- Not triedOne operator apartCore
- Not triedPaths Out of the GridCore
- Not triedPaths That Stay InsideCore
- Not triedCount the Rectangles of OnesChallenge
- Not triedFewest Obstacles to CrossChallenge
- Not triedHow Many Paths Score BestChallenge
- Not triedOne Per Row, Paying to MoveChallenge
- Not triedPaths With a Divisible SumChallenge
- Not triedThe Largest Plus SignChallenge
- Not triedThe Largest Product AcrossChallenge
- Not triedThe Largest Rectangle of OnesChallenge
- Not triedThe Longest Climb Across a GridChallenge
- Not triedThe Richest RectangleChallenge
- Not triedTwo Collectors DescendingChallenge
- Not triedWhen movement opens upChallenge