GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Linear 1D DP
←All Patterns
Dynamic ProgrammingEvidence Contributing

Linear 1D DP

A DP recurrence over a single sequence where each state depends on a small fixed window of previous states.

Practice Problems: 8
Difficulty: 3 Easy·5 Medium·0 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: A DP recurrence over a single sequence where each state depends on a small fixed window of previous states.

Canonical Practice Problems

8 problems
1.Climbing StairsEasy
Solve on LeetCode↗
2.Counting BitsEasy
Solve on LeetCode↗
3.Min Cost Climbing StairsEasy
Solve on LeetCode↗
4.Decode WaysMedium
Solve on LeetCode↗
5.House RobberMedium
Solve on LeetCode↗
6.House Robber IIMedium
Solve on LeetCode↗
7.Maximum Product SubarrayMedium
Solve on LeetCode↗
8.Word BreakMedium
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode 150

8 problems

→

NeetCode All

8 problems

→

Blind 75

7 problems

→

Striver A2Z

4 problems

→

LeetCode Top Interview 150

3 problems

→

Striver SDE Sheet

1 problem

→

Related Algorithmic Patterns

Dynamic Programming2 shared

Take/Skip Adjacent-Constraint DP

Dynamic Programming1 shared

Circular Array DP

Dynamic Programming1 shared

String Alignment / Subsequence DP

Bit Manipulation1 shared

Bit Manipulation - Counting/Shifting

Dynamic Programming

0/1 Knapsack

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