fa717e8a6f
Create a suffix tree from an input string. This implementation uses a stack to control the flow of the program. I expected this attempt to be easier than my first attempt, but surprisingly, it was similarly difficult. It took me ~30-45 minutes to successfully implement this function, and I'm still not pleased with the final result. |
||
---|---|---|
.. | ||
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.