Dynamic Programming Practice Problems From GeeksForGeeks

Branch Name	Description	Links
adding-readme	This branch is created for writing README file and will be updated for every branch as and when it's created	N/A
Development	This is the default branch. All the feature branches created is finally merged with this branch (Link is for the initial commit)	Click Here
number-of-ways-to-get-sum	The number of ways to get sum equal to x by using only 1, 3 and 5	Click Here
ugly-number	Finding nth ugly number (Ugly numbers are numbers whose only prime factors are 2, 3 or 5.)	Click Here
fibonacii-series	Finding nth fibonacii number (Implemented different algorithms of optimization)	Click Here
catalan-number	Count the number of expressions containing n pairs of parentheses which are correctly matched. For n = 3, possible expressions are ((())), ()(()), ()()(), (())(), (()()).	Click Here
rod-cutting	Given a rod of length n inches and an array of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces.	Click Here
maximum-sum	Get the maximum sum in an array given some constraints	N/A