LeetEye LeetEye
Pattern

1-D DP

Solve optimization problems with one-dimensional dynamic programming.

8 Problems
2 Easy
6 Medium
0 Hard

When to Use 1-D DP

Pattern Recognition

Look for these trigger words in problem statements:

climbing stairs 1d-dp min cost climbing stairs house robber house robber ii longest palindromic substring palindromic substrings decode ways word break

Practice Problems

Easy (2) Medium (6) Hard (0)
Climbing Stairs easy Min Cost Climbing Stairs easy House Robber medium House Robber II medium Longest Palindromic Substring medium Palindromic Substrings medium Decode Ways medium Word Break medium

Related Patterns

Backtracking 2-D DP Bit Manipulation

Master 1-D DP

Build pattern recognition with interactive MCQs. Understand why to use 1-D DP, not just how.

Download LeetEye Free
Practice in LeetEye