tvl-depot/scratch
William Carroll 2b5bbb98ca Refactor existing bst-checker implementation
I believe the previous solution is invalid. This solution works and it should be
more time and space efficient.

Space-wise our stack grows proportionate to the depth of our tree, which for a
"balanced" BST should be log(n). Doing a BFT on a BST results in memory usage of
n because when we encounter the leaf nodes at the final level in the tree, they
will be 1/2 * n for a balanced BST.
2020-11-21 14:14:50 +00:00
..
advent-of-code-2019 Move AOC into //scratch 2020-07-20 10:06:40 +01:00
crack_the_coding_interview Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00
data_structures_and_algorithms Impl part 3/3 for Memo 2020-07-01 15:13:56 +01:00
deepmind Drop support for dir-locals.nix, <nixpkgs>, etc. 2020-08-20 11:26:32 +01:00
facebook Refactor existing bst-checker implementation 2020-11-21 14:14:50 +00:00
groceries Ignore comments in output for grocery export 2020-10-03 11:00:11 +01:00
habit-screens Style habit screen to accommodate footer 2020-11-12 11:19:30 +00:00
haskell-programming-from-first-principles Drop support for dir-locals.nix, <nixpkgs>, etc. 2020-08-20 11:26:32 +01:00
README.md Tidy up structure of briefcase 2020-02-12 16:58:29 +00:00

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.