C Programming - Program for Fibonacci numbers - Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.

# Tag - simple dynamic programming example

Box Stacking Problem - Dynamic Programmming The Box Stacking problem is a variation of LIS problem. We need to build a maximum height stack.

Variations of LIS - Dynamic Programming - We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post

Maximum Length Chain of Pairs - Dynamic Programming - The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.

C Programming - Word Wrap Problem - Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line

C++ Programming - Word Wrap Problem - Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line

Java Programming - Word Wrap Problem - Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line

C Programming - Partition Problem - Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets

C++ Programming - Partition Problem - Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets

Java Programming - Partition Problem - Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets