CodingMediumcod-g142

Subject KmpLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a text and a non-empty pattern (when the pattern is empty, define the count as len(text)+1), return the number of occurrences of pattern in text, counting overlapping matches. For example, "aa" occurs 3 times in "aaaa". Both strings may be up to 10^5 characters, so an O(n*m) approach can be too slow; aim for linear time.

Implement

count_overlapping(text: str, pat: 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.