# Algorithms_in_C++: dynamic_programming Directory Reference

Loading...
Searching...
No Matches
dynamic_programming Directory Reference

## Files

file | 0_1_knapsack.cpp
| Implementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)
file | abbreviation.cpp
| Implementation of Abbrievation
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 | house_robber.cpp
| Implementation of House Robber Problem algorithm.
file | kadane2.cpp
| Implementation of [Kadane Algorithm] (https://en.wikipedia.org/wiki/Kadane%27s_algorithm)
file | longest_increasing_subsequence.cpp
| Calculate the length of the longest increasing subsequence in an array.
file | longest_palindromic_subsequence.cpp
| Program to find the Longest Palindormic Subsequence of a string.
file | minimum_edit_distance.cpp
| Implementation of Minimum Edit Distance using Dynamic Programing.
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