Dynamic-Programming 🚀

"Those who cannot remember the past, are condemned to repeat it"

In simple words dp is an optimal form of recursion.

Where to use?

First is recursion from where it all begins.Then to optimize this approach dp was introduced we can differentiate dp in two approach

In this repository you will find both of the approaches.

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
README.md		README.md
a.out		a.out
cellMitosis.cpp		cellMitosis.cpp
coinChange.cpp		coinChange.cpp
countBinaryString.cpp		countBinaryString.cpp
fibonacci.cpp		fibonacci.cpp
friendPairing.cpp		friendPairing.cpp
ladderProblem.cpp		ladderProblem.cpp
maxSumSubarray.cpp		maxSumSubarray.cpp
minCoinChange.cpp		minCoinChange.cpp
minstep.cpp		minstep.cpp
palidromicQueries.cpp		palidromicQueries.cpp
tileProblem.cpp		tileProblem.cpp
tileProblemII.cpp		tileProblemII.cpp
time travel		time travel
wineProblem.cpp		wineProblem.cpp