tvl-depot

mdebray/tvl-depot

Fork 0

Commit graph

Author	SHA1	Message	Date
William Carroll	a8b3a2d3c0	Support part 2/3 for the Memo problem Bound the size of the memo by creating a BoundedQueue. Whenever we add elements to the BoundedQueue, we remove the oldest elements. We use the BoundedQueue to control the size of our dictionary that we're using to store our key-value pairs.	2020-07-01 14:59:49 +01:00
William Carroll	ec7c8516f7	Implement part 1/3 for "Memo" After hearing from a Jane Street recruiter, I decided to dust off some of the DS&As knowledge. I found this article online, which outlines an example problem called "Memo": https://blog.janestreet.com/what-a-jane-street-dev-interview-is-like/ Here's part 1 of the solution in Python.	2020-07-01 14:40:40 +01:00

Author

SHA1

Message

Date

William Carroll

a8b3a2d3c0

Support part 2/3 for the Memo problem

Bound the size of the memo by creating a BoundedQueue. Whenever we add elements
to the BoundedQueue, we remove the oldest elements. We use the BoundedQueue to
control the size of our dictionary that we're using to store our key-value pairs.

2020-07-01 14:59:49 +01:00

William Carroll

ec7c8516f7

Implement part 1/3 for "Memo"

After hearing from a Jane Street recruiter, I decided to dust off some of the
DS&As knowledge. I found this article online, which outlines an example problem
called "Memo":

https://blog.janestreet.com/what-a-jane-street-dev-interview-is-like/

Here's part 1 of the solution in Python.

2020-07-01 14:40:40 +01:00

2 commits