(DP) is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping sub-problems and optimal substructure property.

Problems must have:

1. overlapping sub-problems
2. optimal substructure property.

• adventofcode 2020 day10 part2
• https://hackernoon.com/how-to-solve-unique-path-problem-zj4qt30z3
• https://en.wikipedia.org/wiki/Dynamic_programming
• https://www.educative.io/courses/grokking-dynamic-programming-patterns-for-coding-interviews/m2G1pAq0OO0