java-dynamic-programming
Solving dynamic programming problems in Java
Basic Problems
- Fibonacci Number
- Binomial Expansion
- Longest Common Sequence
- Largest sum of a continuous subarray
- Ugly numbers
- Maximum size square sub-matrix with all 1s
- Longest increasing subsequence
- Cutting a Rod
- Minimum number of jumps to reach end
- Edit distance
- Coin Change
- Subset Sum
- Min Cost Path
- Assembly Line Scheduling
- Maximum Sum Increasing Subsequence
- Maximum Length Chain of Pairs
- Longest Common Substring
- Count all possible paths from top left to bottom right of a mXn matrix
- Program for nth Catalan Number
- Count number of ways to reach a given score in a game
- Tiling Problem
- Count even length binary sequences with same sum of first and second half bits
- Find number of solutions of a linear equation of n variables
- Number of ways to Partition a Set
- Compute nCr % p
- Count number of ways to fill a “n x 4” grid using “1 x 4” tiles
- A Space Optimized Solution of LCS