# Dissecting Dynamic Programming — Target Sum I

At this point in the series, sufficient concepts and information about Dynamic Programming have been covered, such as **optimal substructure**, **overlapping sub-problems**, **problem analysis** and the techniques at arriving at the **recurrence relation**. From this point on, this series will pivot to applying those concepts and techniques to solve simple to more challenging Dynamic Programming problems.

In this blog, we will tackle the “Target Sum” Dynamic Programming problems using the top down approach.