I have a really hard problem with Dynamic Programming Bottom-up (table method).
Someone told me I should first do Top-down, then construct the base case, then construct recursion tree, then convert the recursion tree to Directed Acyclic Graph, then do a topological sort on this graph.
But always I get stuck and I can't find the solution.
Can any one help me with good material or write a blog about this like PrinceOfPersia [Algorithm Gym].
Thanks in advance :D.