Seems like the question was about searching algorithm... I would avoid using brute-force search as the time complexity is O(nxm) where n is the size of text given and m is the size of our string we are trying to look for. Better way to implement this would be combination of BST and linked list.. then time complexity would be O(logn)