First time here? Checkout the FAQ!
+2 votes

Could someone tell me What is the general idea to approach to problems in Dynamic Programming ?

ie. Given a problem How do I start my thinking :P , Im not getting a clue to deal with DP problems .  Making Recursive Equations etc .

Is DP approach is suitable for any problems ?


Example Problem

Min-Coin Change is the problem of using the minimum number of coins to make change for a particular amount of cents, n, using a given set of denominations d_{1}\ldots d_{m}.

Given the denominations 1, 5, 10, 20, 25, and wish to make change for 40 cents, the greedy algorithm would give us 25, 10, 5, but the best solution only requires 2 coins - 2 of the 20 cent coins

asked in Algorithms by Loyal (2.6k points)   | 95 views

if you really want more general idea about DP better search competitive programming problems on others sites and their different solution methods. 

These will be useful ...coin change is there in the first pdf.




By examples we get some idea of DP.
mean >?
like we cannot define it directly.

but examining floyd warshall, bellman ford, knapsack we can understand how it works.

Like a small problem able to solve a big problem.

mostly like fibonacci numbers

I just wanted to know a general method to wrte recursion equation .
See here

I didn't understand how he managed to get the cell  (i)(j)

Please log in or register to answer this question.

Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2244 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1338 Points

  8. Akriti sood

    1246 Points

  9. Bikram

    1246 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,452 questions
26,771 answers
22,985 users