repeated-string-match

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two strings <code>a</code> and <code>b</code>​​​​​​​ consisting of lowercase English letters​​​​​​​.

Return the minimum number of times you should repeat string <code>a</code> so that string <code>b</code> is a substring of it. If it is impossible for <code>b</code>​​​​​​ to be a substring of <code>a</code> after repeating it, return&nbsp;-1.

Note: string <code>&quot;abc&quot;</code> repeated 0 times is <code>&quot;&quot;</code>, repeated 1 time is <code>&quot;abc&quot;</code> and repeated 2 times is <code>&quot;abcabc&quot;</code>.
A subarray is a contiguous sequence of elements within an array.
&nbsp;
Example 1:

<pre>
Input: a = &quot;abcd&quot;, b = &quot;cdabcdab&quot;
Output: 3
Explanation: We return 3 because by repeating a three times &quot;abcdabcdabcd&quot;, b is a substring of it.
</pre>

Example 2:

<pre>
Input: a = &quot;a&quot;, b = &quot;aa&quot;
Output: 2
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= a.length, b.length &lt;= 104</code></li>
	<li><code>a</code> and <code>b</code> consist of lowercase English letters.</li>
</ul>

repeatedStringMatch

Mid Level

Repeated String Match

String

String Matching

Z Algorithm

Knuth–Morris–Pratt Algorithm

Boyer–Moore String-Search Algorithm

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given two strings a and b consisting of lowercase English letters .

Return the minimum number of times you should repeat string a so that string b is a substring of it. If it is impossible for b to be a substring of a after repeating it, return -1.

Note: string "abc" repeated 0 times is "", repeated 1 time is "abc" and repeated 2 times is "abcabc".

A subarray is a contiguous sequence of elements within an array.

 

Example 1:


Input: a = "abcd", b = "cdabcdab"
Output: 3
Explanation: We return 3 because by repeating a three times "abcdabcdabcd", b is a substring of it.


Example 2:


Input: a = "a", b = "aa"
Output: 2


 

Constraints:

 * 1 <= a.length, b.length <= 104
 * a and b consist of lowercase English letters.