What are you using instead? Writing your own Knuth–Morris–Pratt implementation?
That would be sick to show in a tech interview :D "Nah I don't like regexes, I dont bytewise comparisons with my own algorithms" (throw in some big-O terms after that)
"btw did you know regex lookbehind is O(2^n)?"