Algorithms
Dynamic Programming
Graphs
Divide & Conquer
NP-Completeness
Dynamic Programming
6.1
Maximum-Sum Contiguous Subsequence
6.2
Road-Trip Hotel Stops
6.3
Yuckdonald's Restaurant Placement
6.4
Reconstructing a String of Words
LCS
Longest Common Subsequence
6.7
Longest Palindromic Subsequence
CMM
Chain Matrix Multiplication
6.20
Optimal Binary Search Tree
0/1
Knapsack Without Repetition
6.17
Making Change (Unlimited Coins)
6.19
Making Change With at Most k Coins
✕
Approach
Recurrence
Runtime
Full solution →