Dynamic ProgrammingEvidence Contributing
Grid / 2D Path DP
DP over a 2D grid where each cell's value depends on cells reachable by the allowed moves (down/right, etc.).
Practice Problems: 6
Difficulty: 0 Easy·5 Medium·1 Hard
Core technique
Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.
- Core Strategy: DP over a 2D grid where each cell's value depends on cells reachable by the allowed moves (down/right, etc.).