I was asked during technical phone interview for SDE2 the following question:

Find the length of longest substring in string S without forbbiden strings.
E.G. s = "asdfoo123ate" and forbbiden ="[foo, ate]". Answer is 7 ("oo123at").

Follow up: Timecomplexity O(n)