dynamic_programming Directory Reference

## Files

file | 0_1_knapsack.cpp
| Implementation of 0-1 Knapsack Problem
file | coin_change_topdown.cpp
| Minimum coins change problem is a problem used to find the minimum number of coins required to completely reach a target amount.
file | cut_rod.cpp
| Implementation of cutting a rod problem.
file | kadane2.cpp
| Implementation of Kadane Algorithm
file | longest_palindromic_subsequence.cpp
| Program to find the Longest Palindormic Subsequence of a string.
file | palindrome_partitioning.cpp
| Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make.
file | shortest_common_supersequence.cpp
| SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained).
file | word_break.cpp
| Word Break Problem