GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Grid / 2D Path DP
←All Patterns
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.).

Canonical Practice Problems

6 problems
1.Maximal SquareMedium
Solve on LeetCode↗
2.Minimum Path SumMedium
Solve on LeetCode↗
3.TriangleMedium
Solve on LeetCode↗
4.Unique PathsMedium
Solve on LeetCode↗
5.Unique Paths IIMedium
Solve on LeetCode↗
6.Longest Increasing Path in a MatrixHard
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode All

6 problems

→

LeetCode Top Interview 150

4 problems

→

Striver A2Z

4 problems

→

NeetCode 150

2 problems

→

Striver SDE Sheet

2 problems

→

Blind 75

1 problem

→

Related Algorithmic Patterns

Graphs1 shared

Grid DFS Traversal

Dynamic Programming

0/1 Knapsack

Dynamic Programming

Circular Array DP

Dynamic Programming

Expand Around Center

Dynamic Programming

Interval DP

GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy