As we can see that some people have habit of directly using recursive dp even for the easiest of the problems. But it becomes very problematic. You can't solve problems in which you need to save memory by knowing the previous row, and also in some prolems like recent E "Sum over zero" where you will face some issue related to time and memory. And i don't think it's possible to solve it with recursive dp. So i would suggest you guys to solve problems with iterative dp. Make a habit of using iterative dp. It will be beneficial for you guys in future.
Moreover iterative dp is easier to debug!
Iterative DP is harder to come up with than recursive DP. It's good to practice both, but in a contest when it is possible to solve using recursive DP use it, when it's not try to find the iterative.
Some things that I picked up while solving different DP problems:
Some questions: