1D / Linear DP
Save one answer for every position in a sequence.
- Climbing Stairs Easy · Save each smaller answer once
- House Robber Medium · Save each smaller answer once
- Decode Ways Medium · Save each smaller answer once
Algorithm Atlas
Loading your lessons and saved progress.
Learn Dynamic Programming with 7 DSA patterns and 43 visual lessons. Follow step-by-step animations and synced C#, Python, and Java code.
DP saves smaller answers so work is not repeated.
Save one answer for every position in a sequence.
Store one answer for every row-and-column position.
Compare smaller prefixes before solving larger prefixes.
Save the best answer for every start-and-end range.
Store answers on nodes after their children are solved.
Choose items while remembering possible totals.
Remember the best profit in each holding state.