Add staircase question to DP (#112)

* updated dp.md with a typical question * Update dynamic-programming.md
6 years ago · b63528d9de
parent 8de2a989ce
commit b63528d9de
1 changed files with 1 additions and 0 deletions
--- a/algorithms/dynamic-programming.md
+++ b/algorithms/dynamic-programming.md
@ -24,3 +24,4 @@ Dynamic Programming
    // [4, 10, 3, 1, 5] => 15
    ~~~
 - Given a list of denominations (e.g., `[1, 2, 5]` means you have coins worth $1, $2, and $5) and a target number `k`, find all possible combinations, if any, of coins in the given denominations that add up to `k`. You can use coins of the same denomination more than once.
 - You are climbing a flight of stairs. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? E.g. Input: 3, Output: 3. Explanation: `[1, 1, 1], [1, 2], [2, 1]`.