William Carroll 4d2d19f136 Solve InterviewCake's stock-price problem ... Write a function that returns the maximum profit that a trader could have made in a day. I solved this using a greedy algorithm which constantly sets the maximum profit by tracking the lowest price we've encountered.		2020-03-01 22:32:25 +00:00
..
misc	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
.envrc	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
cafe-order-checker.py	Solve InterviewCake's cafe-order-checker problem	2020-02-20 15:20:58 +00:00
delete-node.py	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
inflight-entertainment.ts	Solve InterviewCake's inflight-entertainment problem	2020-02-21 11:30:01 +00:00
merge-sorted-arrays.ts	Solve InterviewCake's merge sorted arrays question	2020-02-19 16:02:38 +00:00
merging-ranges.py	Solve merging-ranges	2020-02-13 14:52:20 +00:00
package-lock.json	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
package.json	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
permutation-palindrome.py	Solve InterviewCake permutation-palindrome problem	2020-03-01 22:32:24 +00:00
reverse-string-in-place.ts	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
reverse-words.py	Solve bonus part of reverse-words	2020-02-19 15:01:42 +00:00
shell.nix	Remove default values for Nix expression parameters	2020-03-01 22:32:24 +00:00
stock-price.py	Solve InterviewCake's stock-price problem	2020-03-01 22:32:25 +00:00
todo.org	Solve InterviewCake's stock-price problem	2020-03-01 22:32:25 +00:00
top-scores.py	Solve InterviewCake's top-scores	2020-03-01 22:32:24 +00:00
word-cloud.py	Solve InterviewCake's word-cloud problem	2020-03-01 22:32:24 +00:00