Count pattern occurrences
Count how many times a non-empty pattern p occurs in text t as a substring, counting overlapping occurrences. Both lowercase. For t='aaaa', p='aa' the answer is 3. Implement it via the Z-function over p + separator + t. Lengths up to a few thousand.
Implement
count_occurrences(t: str, p: str) → intExamples
in
["aaaa","aa"]out3What 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 28 min
solution.py
InputExpectedGot
["aaaa","aa"]3not run yetsample