CodingMediumcod-g811

Subject Z algorithmLevel Mid–Senior~28 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in["aaaa","aa"]out3

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.