Someone said, " Dynamic Programming is easy to learn, but difficult to master. And by "learn" I mean that you know some basic theory and have solved a DP problem. If you know how to find Fibonacci numbers in O(n) time, then yes, you know DP ".
I was wondering that Fibonacci is so easy that should it be even considered a DP problem ?
Like, when I was given the formula fib[i] = fib[i-1] + fib[i-2] , I was not even told that this is DP.
What are your thoughts ?
P.S.: If someone can suggest how to master DP, it would be helpful.