mdebray/tvl-depot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
tvl-depot/scratch
History
William Carroll 56d8d1d7b2 Solve InterviewCake's bst-checker problem 
Write a function that returns true if a given binary tree is a valid binary
search tree (i.e. if all of root's left nodes are less than root.value, all of
root's right nodes are greater than root.value, and both left and right subtrees
are also valid binary search trees).
2020-03-15 23:09:29 +00:00
..
crack_the_coding_interview Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00
data_structures_and_algorithms Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00
deepmind Solve InterviewCake's bst-checker problem 2020-03-15 23:09:29 +00: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.