algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-25 11:12:25 +08:00
Code Issues Packages Projects Releases Wiki Activity

Restructure preparation section

Browse Source
This commit is contained in:
Tay Yang Shun
2017-09-25 09:44:24 +08:00
parent 671b874b43
commit 359490ba47
8 changed files with 96 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms/dynamic-programming.md
View File

@ -22,6 +22,4 @@ Dynamic Programming
// [3, 6, 4] => 7
// [4, 10, 3, 1, 5] => 15
~~~
- How many string representations are there for an integer where `a->1, b->2, ... z->26`.
- E.g. `26 => 2`. Because `26` can be encoded as `"z"` and `"bf"`.
- 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.