Commit a437af1

authored

Update README.md

1 parent e7729ba commit a437af1Copy full SHA for a437af1

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,3 +30,8 @@ Contains code of different DP problems.`
`30`	`30`	`2. [Coin Change : Maximum number of ways](https://github.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/CoinChangeMaxNumber.txt) : [Java Solution](https://github.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMaxNumber.java)`
`31`	`31`
`32`	`32`	`3. [Coin Change : Minumum Number of Coin](https://github.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/coinChangeMinCoin.txt) : [Java Solution](https://github.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMinNumber.java)`
	`33`	`+`
	`34`	`+`
	`35`	`+#### Longest Common Subsequence`
	`36`	`+`
	`37`	`+1. [Longes Common SubSequence Using Recursive](https://github.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/LongestCommonSubsequence.txt) : [Java Solution](https://github.com/mohitsingla123/Dynamic-Programming-java/tree/master/Longest%20Common%20Subsequence)`

Comments

(0)