mdebray/tvl-depot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
tvl-depot/scratch
History
William Carroll 847aad2a14 Implement the Levenstein "edit distance" algorithm 
This is the mother of dynamic programming algorithms in my opinion. It computes
the minimal "edit distance" between two input strings where an edit is
considered one of:
  - inserting a character into `a`
  - deleting a character from `a`
  - substituting a character in `a` with a character from `b`

It took me awhile to grok the algorithm, but I implemented this from my
understanding of something that I read ~3 nights prior, so I must've understood
what I read. Good news!
2020-11-20 21:59:18 +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 Implement the Levenstein "edit distance" algorithm 2020-11-20 21:59:18 +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

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.