How do I create an efficient Dynamic Programming iterative solution if I can develop a recursive solution for the same?
Edit 1: I have seen several problems on spoj where I can design a recursive solution O(2^n) but those solutions generally time out. After looking into the solutions of the problem I found that an iterative solution with O(n^2) mostly works. So, I am just asking is there a general process to create an iterative solution from a recursive one?