Java Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here we use similar merge
dynamic programming problems
78 Articles
78
Python Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.
Minimum number of jumps to reach end – Dynamic Programming An array of integers where elements represents the max number of steps that can be made forward
Java Programming – Program for Fibonacci numbers – Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.
C Programming – Program for Fibonacci numbers – Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.
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