Dynamic Programming - Optimal Substructure
Scenario
Problem where the optimal solution can be constructed from optimal solutions of it's sub-problems.
Clue
Can the problem be broken into sub-problems to get the optimal solution?
Problems
| Problem | Link | Platform | Solution |
|---|---|---|---|
| Maximum Subarray | Link | Solution | |
| Longest Increasing Subsequence | Link | ||
| Coin Change | Link | ||
| Edit Distance | Link | ||
| Longest Common Subsequence | Link |