|
Matcom Online Grader
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
MOG Round #36Ended |
J - Repeating Substring
Languages: C, C++, Java, Python, Kotlin, CSharp
Time & Memory limits: (details)
A repeating substring is a substring that occurs in two (or more) locations in the string. Your task is to find the longest repeating substring in a given string.A repeating substring is a substring that occurs in two (or more) locations in the string. Your task is to find the longest repeating substring in a given string.
Input
The only input line has a string of length $n$ that consists of characters a–z.**Constraints**- $1 \le n \le 10^5$The only input line has a string of length $n$ that consists of characters a–z.
Constraints
- $1 \le n \le 10^5$
Output
Print the longest repeating substring. If there are several possibilities, you can print any of them. If there is no repeating substring, print -1.Print the longest repeating substring. If there are several possibilities, you can print any of them. If there is no repeating substring, print -1.
Sample test(s)
Input
cabababc
Output
abab