Difficulty: Medium
Tags: LeetCode, Medium, String, Binary Search, Dynamic Programming, Suffix Array, Hash Function, Rolling Hash, leetcode-1062, O(nlogn), O(n), 🔒, Rabin-Karp Algorithm

Problem

Given a string s, return the length of the longest repeating substrings. If no repeating substring exists, return 0.

Example 1:

Input: s = "abcd"
Output: 0
Explanation: There is no repeating substring.

Example 2:

Input: s = "abbaba"
Output: 2
Explanation: The longest repeating substrings are "ab" and "ba", each of which occurs twice.

Example 3:

Input: s = "aabcaabdaab"
Output: 3
Explanation: The longest repeating substring is "aab", which occurs 3 times.

Constraints: