Dynamic Programming, or: Why Aaron Patterson should give me $50

A lightning talk proposed by Hsing-Hui Hsu

How I learned about other approaches* to solving Project Euler problems that didn't involve recursion. Can be applied to problems like the maximum sum path and the coin change problems. *Okay so it was just one other approach.

Back to talks