From 7bee4bcaaee622b0a5efe431392b039d1f8d2ba8 Mon Sep 17 00:00:00 2001 From: Yangshun Tay Date: Mon, 14 Jan 2019 20:35:11 -0800 Subject: [PATCH] Update dynamic-programming.md --- algorithms/dynamic-programming.md | 8 +------- 1 file changed, 1 insertion(+), 7 deletions(-) diff --git a/algorithms/dynamic-programming.md b/algorithms/dynamic-programming.md index 327d9c96..6e78630a 100644 --- a/algorithms/dynamic-programming.md +++ b/algorithms/dynamic-programming.md @@ -24,10 +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 stair case. 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? -Example - -Input : 3; -Return : 3; -Steps : [1 1 1], [1 2], [2 1] - +- 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]`.