tvl-depot/scratch/facebook/hard
William Carroll fa717e8a6f Re-implement suffix_tree function
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.
2020-11-19 21:12:36 +00:00
..
binary-adder.py Start working on the "Hard" problems 2020-11-16 17:10:57 +00:00
fisher-yates.py Solve algorithms dealing with randomness 2020-11-17 22:28:24 +00:00
random-choice.py Refactor random-choice 2020-11-17 23:54:54 +00:00
suffix-tree.py Re-implement suffix_tree function 2020-11-19 21:12:36 +00:00