---
id: dynamic-programming
title: Dynamic programming
toc_max_heading_level: 2
---
## Introduction
Dynamic Programming (DP) is usually used to solve optimization problems. The only way to get better at DP is to practice. It takes some amount of practice to be able to recognize that a problem can be solved by DP.
## Learning resources
- [Demystifying Dynamic Programming ](https://medium.freecodecamp.org/demystifying-dynamic-programming-3efafb8d4296 )
- [Dynamic Programming – ](https://dev.to/nikolaotasevic/dynamic-programming--7-steps-to-solve-any-dp-interview-problem-3870 )
- [Less Repetition, More Dynamic Programming ](https://medium.com/basecs/less-repetition-more-dynamic-programming-43d29830a630 ), basecs
- [Dynamic Programming ](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming ), James Aspnes, Yale University
## Techniques
Sometimes you do not need to store the whole DP table in memory, the last two values or the last two rows of the matrix will suffice.
## Recommended questions
- [0/1 Knapsack or Partition Equal Subset Sum ](https://leetcode.com/problems/partition-equal-subset-sum/ )
- [Climbing Stairs ](https://leetcode.com/problems/climbing-stairs/ )
- [Coin Change ](https://leetcode.com/problems/coin-change/ )
- [Longest Increasing Subsequence ](https://leetcode.com/problems/longest-increasing-subsequence/ )
- [Longest Common Subsequence ](https://leetcode.com/problems/longest-common-subsequence/ )
- [Word Break Problem ](https://leetcode.com/problems/word-break/ )
- [Combination Sum ](https://leetcode.com/problems/combination-sum-iv/ )
- [House Robber ](https://leetcode.com/problems/house-robber/ ) and [House Robber II ](https://leetcode.com/problems/house-robber-ii/ )
- [Decode Ways ](https://leetcode.com/problems/decode-ways/ )
- [Unique Paths ](https://leetcode.com/problems/unique-paths/ )
- [Jump Game ](https://leetcode.com/problems/jump-game/ )
## Recommended courses
import AlgorithmCourses from '../\_courses/AlgorithmCourses.md'
< AlgorithmCourses / >
