Pattern occurrence count
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) → 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 25 min
solution.py
InputExpectedGot
["aaaa","aa"]3not run yetsample