mdebray/tvl-depot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
tvl-depot/scratch
History
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
..
crack_the_coding_interview Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00
data_structures_and_algorithms Support part 2/3 for the Memo problem 2020-07-01 14:59:49 +01:00
deepmind Progress with InterviewCake's coin problem 2020-03-31 14:43:03 +01:00
groceries Convert grocery list to an .org file 2020-07-01 10:45:28 +01:00
haskell-programming-from-first-principles Complete exercises for Reader and State chapters 2020-07-01 10:42:57 +01:00
README.md Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00

README.md

Scratch

The purpose of the scratch directory is to host practice exercises. Practice encompasses things like working on data structures and algorithms problems for upcoming coding interviews or general aptitude as well as writing code snippets to help me learn a new programming language or understand an unfamiliar concept.