Let T be a text of length n, and let P be a pattern of length m. Describe an O(n+ m)-time method for finding the longest prefix of P that is a substring of T.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.