tvl-depot/scratch/facebook/hard
William Carroll 1088e4143d Implement a suffix tree
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.
2020-11-19 00:35:23 +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 Implement a suffix tree 2020-11-19 00:35:23 +00:00