You might like to try some exercises from my algorithms class:

http://ozark.hendrix.edu/~yorgey/280/static/hw.7.pdf

You could also look at the lecture notes and try actually implementing the DP algorithms discussed there:

http://ozark.hendrix.edu/~yorgey/280/static/CSCI-280-lecture-notes.pdf (sections 20-22)

More generally, any standard algorithms textbook should have a ton of DP exercises.

-Brent

On Wed, Apr 12, 2017 at 12:47 PM Michael Litchard <litchard.michael@gmail.com> wrote:

I found the below link to be an illuminating read in regards to how to approach dynamic programming in haskell. Now I would like to test my understanding on different exercises.

I'd like suggestions on problems that could be solved by the approach elucidated below.

http://jelv.is/blog/Lazy-Dynamic-Programming/

_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.