maximum-repeating-substring

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

For a string <code>sequence</code>, a string <code>word</code> is <code>k</code>-repeating if <code>word</code> concatenated <code>k</code> times is a substring of <code>sequence</code>. The <code>word</code>&#39;s maximum <code>k</code>-repeating value is the highest value <code>k</code> where <code>word</code> is <code>k</code>-repeating in <code>sequence</code>. If <code>word</code> is not a substring of <code>sequence</code>, <code>word</code>&#39;s maximum <code>k</code>-repeating value is <code>0</code>.

Given strings <code>sequence</code> and <code>word</code>, return the maximum <code>k</code>-repeating value of <code>word</code> in <code>sequence</code>.

&nbsp;
Example 1:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ab&quot;
Output: 2
Explanation: &quot;abab&quot; is a substring in &quot;ababc&quot;.
</pre>

Example 2:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ba&quot;
Output: 1
Explanation: &quot;ba&quot; is a substring in &quot;ababc&quot;. &quot;baba&quot; is not a substring in &quot;ababc&quot;.
</pre>

Example 3:

<pre>
Input: sequence = &quot;ababc&quot;, word = &quot;ac&quot;
Output: 0
Explanation: &quot;ac&quot; is not a substring in &quot;ababc&quot;. 
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= sequence.length &lt;= 100</code></li>
	<li><code>1 &lt;= word.length &lt;= 100</code></li>
	<li><code>sequence</code> and <code>word</code>&nbsp;contains only lowercase English letters.</li>
</ul>