How are Dynamic Programming algorithms implemented in idiomatic Haskell?

Question

Haskell and other functional programming languages are built around the premise of not maintaining state. I\'m still new to how functional programming works and concepts in

Answer 1

Dynamic programming algorithms usually exploit the idea of reducing a problem to simpler problem(s). Its problems can be formulated as some basic fact (say, the shortest path from a square cell to itself has length 0) plus a set of recurrent rules which show exactly how to reduce problem "find shortest path from cell (i,j) to (0,0)" to problem "find shortest paths from cells (i-1,j), (i,j-1) to (0,0); select the best". AFAIK this can be easily expressed in functional style program; no state involved.