🙏

জয়  শ্রী  রাম

🕉

---

Problem Statement:

Given a string S, find out the length of the longest repeating substring(s). Return 0 if no repeating substring exists.

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.

Example 4:
Input: S = "aaaaa"
Output: 4
Explanation: The longest repeating substring is "aaaa", which occurs twice.

Solution:

Algorithm:

Login to Access Content

Java Solution with Detailed Explanation of Implementation Logic:

Login to Access Content

Python Solution with Detailed Explanation of Implementation Logic:

Login to Access Content

Space Optimization by using Hash Code of Substrings:

Login to Access Content

Instructor: