dynamic_programming Directory Reference

Files
	0_1_knapsack.cpp
	Implementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)
	abbreviation.cpp
	Implementation of Abbrievation
	armstrong_number_templated.cpp
	Checks whether a number is an Armstrong Number or not.
	bellman_ford.cpp
	catalan_numbers.cpp
	Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: https://en.wikipedia.org/wiki/Catalan_number https://oeis.org/A000108/.
	coin_change.cpp
	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.
	cut_rod.cpp
	Implementation of cutting a rod problem.
	edit_distance.cpp
	egg_dropping_puzzle.cpp
	fibonacci_bottom_up.cpp
	floyd_warshall.cpp
	house_robber.cpp
	Implementation of House Robber Problem algorithm.
	kadane.cpp
	Implementation of Kadane Algorithm
	longest_common_string.cpp
	contains the definition of the function longest_common_string_length
	longest_common_subsequence.cpp
	longest_increasing_subsequence.cpp
	Calculate the length of the longest increasing subsequence in an array.
	longest_increasing_subsequence_nlogn.cpp
	longest_palindromic_subsequence.cpp
	Program to find the Longest Palindormic Subsequence of a string.
	matrix_chain_multiplication.cpp
	maximum_circular_subarray.cpp
	C++ program for maximum contiguous circular sum problem using Kadane's Algorithm
	minimum_edit_distance.cpp
	Implementation of Minimum Edit Distance using Dynamic Programing.
	palindrome_partitioning.cpp
	Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to make.
	partition_problem.cpp
	searching_of_element_in_dynamic_array.cpp
	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).
	subset_sum_dynamic.cpp
	Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm, which tells whether a subset with target sum exists or not.
	trapped_rainwater.cpp
	Implementation of the Trapped Rainwater Problem
	trapped_rainwater2.cpp
	Implementation of the Trapped Rainwater Problem
	tree_height.cpp
	unbounded_0_1_knapsack.cpp
	Implementation of the Unbounded 0/1 Knapsack Problem.
	word_break.cpp
	Word Break Problem