Substring search with Z-algorithm
Implement substring search: return the index of the first occurrence of pat in text, or -1 if it does not occur. If pat is empty, return 0. Solve it in linear time using the Z-algorithm on the concatenation pat + sentinel + text (the sentinel must be a character that cannot appear in either input). For example, the first occurrence of "issip" in "mississippi" starts at index 4.
Implement
first_occurrence_z(text: str, pat: str) → intExamples
in
["mississippi","issip"]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["mississippi","issip"]4not run yetsample