Question $1$

Given three strings, text, prefixpsitring, and

suffixString, find:

pretixiscore: the longest substring of text matching

the end of prefixstring

suffixScore: the longest substring of text matching

the beginning of suffix String.

Sum the lengths of the two strings to get the

textScore. The substring of text that begins with the

matching prefix and ends with matching suffix, and

has the highest textScore, is the correct value to

return. If there are other substrings with equal

textScore, return the lexicographically lowest

substring.

Example

text $=$ engine

prefix String $=$ raven

suffixString $=$ ginkgo

engine matches raven, so prefixScore $=2$