Minimum number of times A has to be repeated such that B is a substring of it

The task is to find the minimum number of times string s1 has to be repeated such that string s2 becomes a substring of the repeated string. The solution uses both a naive approach and the KMP algorithm to achieve this efficiently. The program returns the minimum repetition count or -1 if no solution exists.

For more details, check out the full article: Minimum Repetitions of s1 such that s2 is a substring of it.