Dynamic programming (DP) problems are interesting and at the same time challenging to solve. It requires a combination of rigorous analysis and a methodical approach to come up with solution for this type of problem. This session is designed to aid interviewees with a better understanding of the characteristics of DP problems, to explain the different approaches that one can apply and more importantly to provide a recipe that outlines a sequence of steps to transition from a brute force solution to an optimized solution. With sufficient amount of practicing in applying this recipe, interviewees can easily handle and have fun at solving DP problems. The insights and intuitions gain from mastering DP problem solving technique can easily be translated to solving other types of problems such as backtracking.