Fast sub string searching in amortized O(d) with Suffix Trees
There are a lot of ways to test if a string is contained within another
A Software Engineering Space
There are a lot of ways to test if a string is contained within another
Along with arrays and lists, trees are the one of the most fundamental data structures