Dynamic programming remembers past answers to avoid work

Instead of recalculating massive equations over and over, Dynamic Programming utilizes a technique called 'Memoization'. It simply writes down the answers to difficult steps on a digital scratchpad. The next time the computer encounters the exact same problem, it lazily looks up the answer instead of doing the math again, proving that optimal computing is heavily based on calculated laziness.