What is Dynamic Programming and how is it done?
145976 People Read – 4825 People Liked – You Can Also Like
This is how we can start learning Dynamic Programming. It is an extensively used concept when solving problems for competitive programming and interviews.
Dynamic Programming involves taking a recursive approach to problem solving and then memoizing subproblem solutions.
You will often find Dynamic Programming in interview and competitive programming questions. They usually rely more on intuition and mathematical clarity than deep knowledge of data structures. Intensive mathematical proof for a problem is rarely needed before trying out a DP approach.
References:
Introduction to Algorithms – Cormen
http://www.geeksforgeeks.org/dynamic-programming-set-1/
http://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/
#dynamic-programming #dp #competitive-programming