longest-duplicate-substring

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a string <code>s</code>, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times.&nbsp;The occurrences&nbsp;may overlap.

Return any duplicated&nbsp;substring that has the longest possible length.&nbsp;If <code>s</code> does not have a duplicated substring, the answer is <code>&quot;&quot;</code>.

&nbsp;
Example 1:
<pre>Input: s = "banana"
Output: "ana"
</pre>Example 2:
<pre>Input: s = "abcd"
Output: ""
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= s.length &lt;= 3 * 104</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

longestDupSubstring

Longest Duplicate Substring

String

Binary Search

Sliding Window

Rolling Hash

Suffix Array

Hash Function

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie