Min Repeats for Substring Match
Last Updated :
02 Aug, 2025
Given two strings s1 and s2, find the minimum number of times s1 must be repeated so that s2 becomes a substring of the resulting string.
If it is not possible for s2 to be a substring, return -1.
Examples:
Input: s1 = "abac", s2 = "cabaca"
Output: 3
Explanation: After repeating s1 three times, s1 will become “abacabacabac”. Now, s2 is now a substring of s1 = "abacabacabac". Also s2 is not a substring of s1 when it is repeated less than 3 times.
Input: s1 = "ab", s2 = "cab"
Output : -1
Explanation: s2 can not become a substring of s1 after any repetition of s1.
[Naive Approach] Search s2 Over s1 Loop - O(n * m) Time and O(1) Space
The idea is instead of appending string s1 multiple times, we will simply use modulo (i % n) when we reach the end of string s1. Now, iterate over all the characters of s1 and for each character, consider it as the starting point of s2 and start comparing s1 and s2 character by character till we find a mismatch or s2 gets completed. If s2 gets completed, then it means we have found a match and we can simply return the number of times we reached the end of string s1.
C++
#include <iostream>
#include <vector>
using namespace std;
int minRepeats(string &s1, string &s2) {
int n = s1.length(), m = s2.length();
// Iterate over all characters of s1
// and start comparing with s2
for (int i = 0; i < n; i++) {
int rep = 1, idx1 = i;
bool found = true;
// Compare each character of s2 with s1
for (int idx2 = 0; idx2 < m; idx2++) {
if (s1[idx1%n] != s2[idx2]) {
found = false;
break;
}
idx1++;
// If we have reached the end of s1, reset the
// index to 0
if (idx1 == n) {
idx1 = 0;
// If we have remaining character in s2, then
// s1 needs to repeated again so increment
// repetitions by 1
if (idx2 != m - 1)
rep++;
}
}
// If s2 is found, return the number of times
// s1 has been repeated
if (found)
return rep;
}
// If no occurrence of s2 is found, return -1
return -1;
}
int main() {
string s1 = "abac";
string s2 = "cabaca";
cout << minRepeats(s1, s2);
return 0;
}
class GfG {
static int minRepeats(String s1, String s2) {
int n = s1.length(), m = s2.length();
// Iterate over all characters of s1
// and start comparing with s2
for (int i = 0; i < n; i++) {
int rep = 1, idx1 = i;
boolean found = true;
// Compare each character of s2 with s1
for (int idx2 = 0; idx2 < m; idx2++) {
if (s1.charAt(idx1) != s2.charAt(idx2)) {
found = false;
break;
}
idx1++;
// If we have reached the end of s1, reset the
// index to 0
if (idx1 == n) {
idx1 = 0;
// If we have remaining character in s2, then
// s1 needs to repeated again so increment
// repetitions by 1
if (idx2 != m - 1)
rep++;
}
}
// If s2 is found, return the number of times
// s1 has been repeated
if (found)
return rep;
}
// If no occurrence of s2 is found, return -1
return -1;
}
public static void main(String[] args) {
String s1 = "abac";
String s2 = "cabaca";
System.out.println(minRepeats(s1, s2));
}
}
def minRepeats(s1, s2):
n, m = len(s1), len(s2)
# Iterate over all characters of s1
# and start comparing with s2
for i in range(n):
rep = 1
idx1 = i
found = True
# Compare each character of s2 with s1
for idx2 in range(m):
if s1[idx1] != s2[idx2]:
found = False
break
idx1 += 1
# If we have reached the end of s1, reset the
# index to 0
if idx1 == n:
idx1 = 0
# If we have remaining character in s2, then
# s1 needs to repeated again so increment
# repetitions by 1
if idx2 != m - 1:
rep += 1
# If s2 is found, return the number of times
# s1 has been repeated
if found:
return rep
# If no occurrence of s2 is found, return -1
return -1
if __name__ == "__main__":
s1 = "abac"
s2 = "cabaca"
print(minRepeats(s1, s2))
using System;
class GfG {
static int minRepeats(string s1, string s2) {
int n = s1.Length, m = s2.Length;
// Iterate over all characters of s1
// and start comparing with s2
for (int i = 0; i < n; i++) {
int rep = 1, idx1 = i;
bool found = true;
// Compare each character of s2 with s1
for (int idx2 = 0; idx2 < m; idx2++) {
if (s1[idx1] != s2[idx2]) {
found = false;
break;
}
idx1++;
// If we have reached the end of s1, reset the
// index to 0
if (idx1 == n) {
idx1 = 0;
// If we have remaining character in s2, then
// s1 needs to repeated again so increment
// repetitions by 1
if (idx2 != m - 1)
rep++;
}
}
// If s2 is found, return the number of times
// s1 has been repeated
if (found)
return rep;
}
// If no occurrence of s2 is found, return -1
return -1;
}
static void Main() {
string s1 = "abac";
string s2 = "cabaca";
Console.WriteLine(minRepeats(s1, s2));
}
}
function minRepeats(s1, s2) {
let n = s1.length, m = s2.length;
// Iterate over all characters of s1
// and start comparing with s2
for (let i = 0; i < n; i++) {
let rep = 1, idx1 = i;
let found = true;
// Compare each character of s2 with s1
for (let idx2 = 0; idx2 < m; idx2++) {
if (s1[idx1] !== s2[idx2]) {
found = false;
break;
}
idx1++;
// If we have reached the end of s1,
// reset the index to 0
if (idx1 === n) {
idx1 = 0;
// If we have remaining character in s2, then
// s1 needs to repeated again so increment
// repetitions by 1
if (idx2 !== m - 1)
rep++;
}
}
// If s2 is found, return the number of times
// s1 has been repeated
if (found)
return rep;
}
// If no occurrence of s2 is found, return -1
return -1;
}
// Driver code
let s1 = "abac";
let s2 = "cabaca";
console.log(minRepeats(s1, s2));
[Expected Approach] Using KMP Algorithm - O(n + m) Time and O(m) Space
The idea is to use the KMP (Knuth-Morris-Pratt) pattern matching algorithm to efficiently check if s2 is a substring of repeated s1, without actually constructing the repeated string. Instead of concatenating s1 multiple times, we simulate repetition by cycling through its characters using the modulo operator (%).
We first calculate the minimum number of repetitions x = ceil(len(s2) / len(s1)), and since a potential match could start near the end of one repetition and continue into the next, we also check for x + 1 repetitions. By combining KMP with modulo-based cyclic traversal of s1, we perform the match efficiently in linear time without extra space overhead.
Step by Step Implementation:
- Compute x = ceil(len(s2) / len(s1)), the minimum number of repetitions needed based on length.
- Build the KMP prefix array for s2, where each lps[i] stores the length of the longest proper prefix of s2[0...i] which is also a suffix.
- Start simulating character comparison between repeated s1 and s2 using two pointers: i for the repeated string and j for s2.
- Access characters of repeated s1 using s1[i % len(s1)] to simulate repetition without constructing the full string.
- If characters match, increment both i and j.
- If characters don’t match and j > 0, backtrack using j = lps[j - 1].
- If j == 0, move forward by incrementing i only.
- If j reaches len(s2), it means a match is found — return ceil(i / len(s1)) as the minimum repetition count.
- If the loop completes without a full match, return -1.
C++
#include <iostream>
#include <vector>
using namespace std;
// function to compute the LPS Array
void computeLPSArray(string &s, vector<int> &lps) {
int len = 0, idx = 1;
// lps[0] is always 0
lps[0] = 0;
// the loop calculates lps[i] for
// i = 1 to str.length() - 1
while (idx < s.length()) {
if (s[idx] == s[len]) {
len++;
lps[idx] = len;
idx++;
}
else {
// If len is 0, then we have no common prefix
// which is also a suffix
if (len == 0) {
lps[idx] = 0;
idx++;
}
else {
// Note that we do not move to the next
// index
len = lps[len - 1];
}
}
}
}
// function to find the occurrence of pat in txt
bool KMPSearch(string &txt, string &pat, vector<int> &lps, int rep) {
int n = txt.length(), m = pat.length();
int i = 0, j = 0;
// Iterate till s1 is repeated rep times
while (i < n * rep) {
// If characters match, move both pointers forward
if (txt[i % n] == pat[j]) {
i++;
j++;
// If the entire pattern is matched
// store the start index in result
if (j == m) {
return true;
}
}
// If there is a mismatch
else {
// Use lps value of previous index
// to avoid redundant comparisons
if (j != 0)
j = lps[j - 1];
else
i++;
}
}
return false;
}
// function to find Minimum number of times s1 has to be
// repeated such that s2 is a substring of it
int minRepeats(string &s1, string &s2) {
int n = s1.length();
int m = s2.length();
// Declare and Compute the LPS Table
vector<int> lps(m);
computeLPSArray(s2, lps);
// Find the minimum nnumber of times s1 needs to be
// repeated to become as long as s2
int x = (m + n - 1) / n;
// Check when string s1 is repeated x times
if (KMPSearch(s1, s2, lps, x))
return x;
// Check when string s1 is repeated (x + 1) times
if (KMPSearch(s1, s2, lps, x + 1))
return x + 1;
// If string s2 was not found, return -1
return -1;
}
int main() {
string s1 = "abac";
string s2 = "cabaca";
cout << minRepeats(s1, s2);
return 0;
}
#include <stdio.h>
#include <string.h>
#include <stdbool.h>
// function to compute the LPS Array
void computeLPSArray(char *s, int *lps, int len) {
int length = 0, idx = 1;
// lps[0] is always 0
lps[0] = 0;
// the loop calculates lps[i] for
// i = 1 to str.length() - 1
while (idx < len) {
if (s[idx] == s[length]) {
length++;
lps[idx] = length;
idx++;
}
else {
// If length is 0, then we have no common prefix
// which is also a suffix
if (length == 0) {
lps[idx] = 0;
idx++;
}
else {
// Note that we do not move to the next index
length = lps[length - 1];
}
}
}
}
// function to find the occurrence of pat in txt
bool KMPSearch(char *txt, char *pat, int *lps, int rep, int n) {
int m = strlen(pat);
int i = 0, j = 0;
// Iterate till s1 is repeated rep times
while (i < n * rep) {
// If characters match, move both pointers forward
if (txt[i % n] == pat[j]) {
i++;
j++;
// If the entire pattern is matched
if (j == m) {
return true;
}
}
else {
// If there is a mismatch use lps value of previous
// index to avoid redundant comparisons
if (j != 0)
j = lps[j - 1];
else
i++;
}
}
return false;
}
// function to find Minimum number of times s1 has to be
// repeated such that s2 is a substring of it
int minRepeats(char *s1, char *s2) {
int n = strlen(s1);
int m = strlen(s2);
// Compute the LPS Array
int lps[m];
computeLPSArray(s2, lps, m);
// Find the minimum number of times s1 needs to be
// repeated to become as long as s2
int x = (m + n - 1) / n;
// Check when string s1 is repeated x times
if (KMPSearch(s1, s2, lps, x, n))
return x;
// Check when string s1 is repeated (x + 1) times
if (KMPSearch(s1, s2, lps, x + 1, n))
return x + 1;
// If string s2 was not found, return -1
return -1;
}
int main() {
char s1[] = "abac";
char s2[] = "cabaca";
printf("%d\n", minRepeats(s1, s2));
return 0;
}
class GfG {
// function to compute the LPS Array
static void computeLPSArray(String s, int[] lps) {
int len = 0, idx = 1;
// lps[0] is always 0
lps[0] = 0;
// the loop calculates lps[i] for
// i = 1 to str.length() - 1
while (idx < s.length()) {
if (s.charAt(idx) == s.charAt(len)) {
len++;
lps[idx] = len;
idx++;
}
else {
// If len is 0, then we have no common prefix
// which is also a suffix
if (len == 0) {
lps[idx] = 0;
idx++;
}
else {
// Note that we do not move to the next index
len = lps[len - 1];
}
}
}
}
// function to find the occurrence of pat in txt
static boolean KMPSearch(String txt, String pat, int[] lps, int rep) {
int n = txt.length(), m = pat.length();
int i = 0, j = 0;
// Iterate till s1 is repeated rep times
while (i < n * rep) {
// If characters match, move both pointers forward
if (txt.charAt(i % n) == pat.charAt(j)) {
i++;
j++;
// If the entire pattern is matched
if (j == m) {
return true;
}
}
else {
// If there is a mismatch
// Use lps value of previous index to avoid redundant comparisons
if (j != 0)
j = lps[j - 1];
else
i++;
}
}
return false;
}
// function to find Minimum number of times s1 has to be
// repeated such that s2 is a substring of it
static int minRepeats(String s1, String s2) {
int n = s1.length();
int m = s2.length();
// Declare and Compute the LPS Table
int[] lps = new int[m];
computeLPSArray(s2, lps);
// Find the minimum number of times s1 needs to be
// repeated to become as long as s2
int x = (m + n - 1) / n;
// Check when string s1 is repeated x times
if (KMPSearch(s1, s2, lps, x))
return x;
// Check when string s1 is repeated (x + 1) times
if (KMPSearch(s1, s2, lps, x + 1))
return x + 1;
// If string s2 was not found, return -1
return -1;
}
public static void main(String[] args) {
String s1 = "abac";
String s2 = "cabaca";
System.out.println(minRepeats(s1, s2));
}
}
def computeLPSArray(s):
lps = [0] * len(s)
len_ = 0
idx = 1
# the loop calculates lps[i] for
# i = 1 to str.length() - 1
while idx < len(s):
if s[idx] == s[len_]:
len_ += 1
lps[idx] = len_
idx += 1
else:
# If len is 0, then we have no common prefix
# which is also a suffix
if len_ == 0:
lps[idx] = 0
idx += 1
else:
# Note that we do not move to the next index
len_ = lps[len_ - 1]
return lps
# function to find the occurrence of pat in txt
def KMPSearch(txt, pat, lps):
n, m = len(txt), len(pat)
i = j = 0
# Iterate till s1 is repeated rep times
while i < n:
# If characters match, move both pointers forward
if txt[i] == pat[j]:
i += 1
j += 1
# If the entire pattern is matched
if j == m:
return True
# Use lps of previous index to skip
# unnecessary comparisons
j = lps[j - 1]
else:
# If there is a mismatch, use lps value of
# previous index to avoid redundant comparisons
if j != 0:
j = lps[j - 1]
else:
i += 1
return False
# function to find Minimum number of times s1 has to be
# repeated such that s2 is a substring of it
def minRepeats(s1, s2):
n, m = len(s1), len(s2)
# Declare and Compute the LPS Table
lps = computeLPSArray(s2)
# Find the minimum number of times s1 needs to be
# repeated to become as long as s2
x = (m + n - 1) // n
text = s1 * x
# Check when string s1 is repeated x times
if KMPSearch(text, s2, lps):
return x
text += s1
# Check when string s1 is repeated (x + 1) times
if KMPSearch(text, s2, lps):
return x + 1
# If string s2 was not found, return -1
return -1
if __name__ == '__main__':
s1 = "abac"
s2 = "cabaca"
print(minRepeats(s1, s2))
using System;
using System.Collections.Generic;
class GfG {
// function to compute the LPS Array
static void computeLPSArray(string s, int[] lps) {
int len = 0, idx = 1;
// lps[0] is always 0
lps[0] = 0;
// the loop calculates lps[i] for
// i = 1 to str.length() - 1
while (idx < s.Length) {
if (s[idx] == s[len]) {
len++;
lps[idx] = len;
idx++;
}
else {
// If len is 0, then we have no common prefix
// which is also a suffix
if (len == 0) {
lps[idx] = 0;
idx++;
}
else {
// Note that we do not move to the next
// index
len = lps[len - 1];
}
}
}
}
// function to find the occurrence of pat in txt
static bool KMPSearch(string txt, string pat, int[] lps, int rep) {
int n = txt.Length, m = pat.Length;
int i = 0, j = 0;
// Iterate till s1 is repeated rep times
while (i < n * rep) {
// If characters match, move both pointers forward
if (txt[i % n] == pat[j]) {
i++;
j++;
// If the entire pattern is matched
// store the start index in result
if (j == m) {
return true;
}
}
else {
// If there is a mismatch use lps value of
// previous index to avoid redundant comparisons
if (j != 0)
j = lps[j - 1];
else
i++;
}
}
return false;
}
// function to find Minimum number of times s1 has to be
// repeated such that s2 is a substring of it
static int minRepeats(string s1, string s2) {
int n = s1.Length;
int m = s2.Length;
// Declare and Compute the LPS Table
int[] lps = new int[m];
computeLPSArray(s2, lps);
// Find the minimum number of times s1 needs to be
// repeated to become as long as s2
int x = (m + n - 1) / n;
// Check when string s1 is repeated x times
if (KMPSearch(s1, s2, lps, x))
return x;
// Check when string s1 is repeated (x + 1) times
if (KMPSearch(s1, s2, lps, x + 1))
return x + 1;
// If string s2 was not found, return -1
return -1;
}
static void Main() {
string s1 = "abac";
string s2 = "cabaca";
Console.WriteLine(minRepeats(s1, s2));
}
}
function computeLPSArray(s) {
let len = 0;
const lps = new Array(s.length).fill(0);
let idx = 1;
// lps[0] is always 0
while (idx < s.length) {
if (s[idx] === s[len]) {
len++;
lps[idx] = len;
idx++;
}
else {
// If len is 0, then we have no common prefix
// which is also a suffix
if (len === 0) {
lps[idx] = 0;
idx++;
}
else {
// Note that we do not move to the next
// index
len = lps[len - 1];
}
}
}
return lps;
}
// function to find the occurrence of pat in txt
function KMPSearch(txt, pat, lps, rep) {
const n = txt.length;
const m = pat.length;
let i = 0, j = 0;
// Iterate till s1 is repeated rep times
while (i < n * rep) {
// If characters match, move both pointers forward
if (txt[i % n] === pat[j]) {
i++;
j++;
// If the entire pattern is matched
// store the start index in result
if (j === m) {
return true;
}
}
else {
// If there is a mismatch use lps value of
// previous index to avoid redundant comparisons
if (j !== 0)
j = lps[j - 1];
else
i++;
}
}
return false;
}
// function to find Minimum number of times s1 has to be
// repeated such that s2 is a substring of it
function minRepeats(s1, s2) {
const n = s1.length;
const m = s2.length;
// Declare and Compute the LPS Table
const lps = computeLPSArray(s2);
// Find the minimum number of times s1 needs to be
// repeated to become as long as s2
const x = Math.ceil(m / n);
// Check when string s1 is repeated x times
if (KMPSearch(s1, s2, lps, x))
return x;
// Check when string s1 is repeated (x + 1) times
if (KMPSearch(s1, s2, lps, x + 1))
return x + 1;
// If string s2 was not found, return -1
return -1;
}
// Driver Code
const s1 = "abac";
const s2 = "cabaca";
console.log(minRepeats(s1, s2));
Minimum number of times A has to be repeated such that B is a substring of it
Visit Course
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem