algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-08-01 06:33:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix grammar issues in DP (#53)

Browse Source 
* ran content through grammar checker and break the code example after
column 100 to remove horizontal scroll bar when viewing on GitHub

* Update dynamic-programming.md
This commit is contained in:
Amir Ariffin
2017-10-17 18:51:23 +08:00
committed by Yangshun Tay
parent 88bc6fdc5c
commit d8c3f984e4
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
algorithms/dynamic-programming.md
View File

@ -5,8 +5,8 @@ Dynamic Programming
- Given some coin denominations and a target value `M`, return the coins combination with the minimum number of coins. - Given some coin denominations and a target value `M`, return the coins combination with the minimum number of coins.
- Time complexity: `O(MN)`, where N is the number of distinct type of coins. - Time complexity: `O(MN)`, where N is the number of distinct type of coins.
- Space complexity: `O(M)`. - Space complexity: `O(M)`.
- Given a set of numbers in an array which represent number of consecutive days of AirBnb reservation requested, as a host, pick the sequence which maximizes the number of days of occupancy, at the same time, leaving at least a 1 day gap in-between bookings for cleaning. - Given a set of numbers in an array which represent a number of consecutive days of Airbnb reservation requested, as a host, pick the sequence which maximizes the number of days of occupancy, at the same time, leaving at least a 1-day gap in-between bookings for cleaning.
- Problem reduces to finding the maximum sum of non-consecutive array elements. - The problem reduces to finding the maximum sum of non-consecutive array elements.
- E.g. - E.g.
~~~ ~~~
// [5, 1, 1, 5] => 10 // [5, 1, 1, 5] => 10
@ -16,7 +16,8 @@ Dynamic Programming
// Dec 6 - 7 // Dec 6 - 7
// Dec 7 - 12 // Dec 7 - 12
The answer would be to pick Dec 1-5 (5 days) and then pick Dec 7-12 for a total of 10 days of occupancy, at the same time, leaving at least 1 day gap for cleaning between reservations. The answer would be to pick Dec 1-5 (5 days) and then pick Dec 7-12 for a total of 10 days of
occupancy, at the same time, leaving at least 1-day gap for cleaning between reservations.
Similarly, Similarly,
// [3, 6, 4] => 7 // [3, 6, 4] => 7