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.