0
/ 50

Given a string and a non-empty substring `sub`

, compute recursively if at least `n`

copies of `sub`

appear in the string somewhere, possibly...

Given a string and a non-empty substring `sub`

, compute recursively if at least `n`

copies of `sub`

appear in the string somewhere, possibly overlapping each other. The given `n`

will be non-negative.

Your feedback will appear here when you check your answer.