Dynamic programming--tabulation method bottom up

Question

Just practicing some general problems on dynamic programming.Problem is I am unable to think of tabulation or bottom up approach for most of the new type of problems other than common ones.I am trying to get the naive recursion first then using memoization easily to optimize.Can someone who is in good peak of programming at this moment let me know how to get some idea of tabulating easily?..For example take coin exchange problem.

Comments

thanks guys....but I am facing problem mainly in tabulation process....I am getting the recursion solutions then easily memoizing it and the program works fine...but bottom up approach I am not getting directly...

---

See second sol. here https://www.geeksforgeeks.org/longest-common-subsequence/

Also second sol. here:-   https://www.geeksforgeeks.org/knapsack-problem/

These are based on bottom up approach

---

hmm..thanks rahul...I am following geeksforgeeks...really good programming problems...