Dynamic Programming is a way to solve the problems involving recursive relations optimally i.e. in the minimum possible time complexity.