https://github.com/chen0040/java-dynamic-programming
Solving dynamic programming problems in Java
https://github.com/chen0040/java-dynamic-programming
dynamic-programming geeks4geeks
Last synced: 11 months ago
JSON representation
Solving dynamic programming problems in Java
- Host: GitHub
- URL: https://github.com/chen0040/java-dynamic-programming
- Owner: chen0040
- License: mit
- Created: 2017-08-29T00:40:32.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2017-09-20T05:34:54.000Z (almost 9 years ago)
- Last Synced: 2023-02-26T11:02:52.281Z (over 3 years ago)
- Topics: dynamic-programming, geeks4geeks
- Language: Java
- Size: 34.2 KB
- Stars: 13
- Watchers: 3
- Forks: 10
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# java-dynamic-programming
Solving dynamic programming problems in Java
## Basic Problems
* [Fibonacci Number](http://www.geeksforgeeks.org/program-for-nth-fibonacci-number/)
* [Binomial Expansion](http://www.geeksforgeeks.org/dynamic-programming-set-9-binomial-coefficient/)
* [Longest Common Sequence](http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/)
* [Largest sum of a continuous subarray](http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/)
* [Ugly numbers](http://www.geeksforgeeks.org/ugly-numbers/)
* [Maximum size square sub-matrix with all 1s](http://www.geeksforgeeks.org/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix/)
* [Longest increasing subsequence](http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/)
* [Cutting a Rod](http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/)
* [Minimum number of jumps to reach end](http://www.geeksforgeeks.org/minimum-number-of-jumps-to-reach-end-of-a-given-array/)
* [Edit distance](http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/)
* [Coin Change](http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/)
* [Subset Sum](http://www.geeksforgeeks.org/dynamic-programming-subset-sum-problem/)
* [Min Cost Path](http://www.geeksforgeeks.org/dynamic-programming-set-6-min-cost-path/)
* [Assembly Line Scheduling](http://www.geeksforgeeks.org/dynamic-programming-set-34-assembly-line-scheduling/)
* [Maximum Sum Increasing Subsequence](http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/)
* [Maximum Length Chain of Pairs](http://www.geeksforgeeks.org/dynamic-programming-set-20-maximum-length-chain-of-pairs/)
* [Longest Common Substring](http://www.geeksforgeeks.org/longest-common-substring/)
* [Count all possible paths from top left to bottom right of a mXn matrix](http://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/)
* [Program for nth Catalan Number](http://www.geeksforgeeks.org/program-nth-catalan-number/)
* [Count number of ways to reach a given score in a game](http://www.geeksforgeeks.org/count-number-ways-reach-given-score-game/)
* [Tiling Problem](http://www.geeksforgeeks.org/tiling-problem/)
* [Count even length binary sequences with same sum of first and second half bits](http://www.geeksforgeeks.org/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](http://www.geeksforgeeks.org/find-number-of-solutions-of-a-linear-equation-of-n-variables/)
* [Number of ways to Partition a Set](http://www.geeksforgeeks.org/bell-numbers-number-of-ways-to-partition-a-set/)
* [Compute nCr % p](http://www.geeksforgeeks.org/compute-ncr-p-set-1-introduction-and-dynamic-programming-solution/)
* [Count number of ways to fill a “n x 4” grid using “1 x 4” tiles](http://www.geeksforgeeks.org/count-number-of-ways-to-fill-a-n-x-4-grid-using-1-x-4-tiles/)
* [A Space Optimized Solution of LCS](http://www.geeksforgeeks.org/space-optimized-solution-lcs/)