1088e4143d
While it took me awhile to implement, this exercise was definitely worth doing. I think there should be a more elegant way to construct the tree using maybe a stack, but I couldn't find it. All of this was part of a larger effort to search a string for a variety of patterns. The solution is to compile the string into a suffix tree and then search the suffix tree for each of the patterns. I'm glad I didn't gloss over this exercise. |
||
---|---|---|
.. | ||
advent-of-code-2019 | ||
crack_the_coding_interview | ||
data_structures_and_algorithms | ||
deepmind | ||
groceries | ||
habit-screens | ||
haskell-programming-from-first-principles | ||
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.