Hacker News new | past | comments | ask | show | jobs | submit login

Lots of project Euler problems have dp solutions. Try http://projecteuler.net/index.php?section=problems&id=21... for a fairly easy one, or http://projecteuler.net/index.php?section=problems&id=20... for a harder one.

Note that many others have dp solutions, but the easiest way to find them is to write a recursive function that you memoize. A good example of that is http://projecteuler.net/index.php?section=problems&id=30....




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: