You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2.0 KiB
2.0 KiB
| id | title | toc_max_heading_level |
|---|---|---|
| dynamic-programming | Dynamic programming | 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
- Dynamic Programming – 7 Steps to Solve any DP Interview Problem
- Less Repetition, More Dynamic Programming, basecs
- Dynamic Programming, 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
- Climbing Stairs
- Coin Change
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break Problem
- Combination Sum
- House Robber and House Robber II
- Decode Ways
- Unique Paths
- Jump Game
Recommended courses
import AlgorithmCourses from '../_courses/AlgorithmCourses.md'