So far the current dynamic programming article doesn't go over the basics. Right now I am working on a Project Euler problem that I suspect involves rewriting a for loop as a recursion to memoize values.

Here is a simple DP problem https://projecteuler.net/problem=114 where you can easily break into cases based on the "last block". There actually was an easier problem involving just size 1 and 3 blocks I believe but I can't find it now.