What is the better way to solve dp

iterative storage or recursive storage

@Narasimha,
DP itself means you will use an iterative method instead of a recursive approach to avoid duplicate calls multiple times.

There are following two different ways to store the values so that the values of a sub-problem can be reused. Two patterns of solving DP problem:

Tabulation: Bottom Up
Memoization: Top Down