Hello there, <br /> <br />↵
I was trying to solve this [problem](https://www.hackerearth.com/code-monk-triessuffix-tree/algorithm/power-of-string-3/) on Hackerearth the problem asks for the length of **the longest substring** which is repeated at least **K** times, **1 <= K <= |S| <= 10^6** <br /> <br />↵
I built the suffix array of the string and built the LCP array then get the maximum element among the minimum elements in all possible consecutive segments of length **K-1** in the LCP array, Thus, if the LCP array was **[0,1,2,3,2,3]** and K was **4** then we have : <br /><br />↵
1. [0,1,2] min is 0 <br />↵
2. [1,2,3] min is 1 <br />↵
3. [2,3,2] min is 2 <br />↵
4. [3,2,3] min is 2 <br /> <br />↵
Now the maximum element is 2 and this is the answer, My solution keeps getting WA on some test files, and unfortunately editorial page has no explanation about the solution, just two codes, one uses an absolutely different idea where it uses hashing and binary search (No idea!!) and the other one slightly uses the same idea using suffix tree instead but it's so messy and couldn't track it down. <br /> <br />↵
Here's my [code](http://pastebin.com/i4JHMr76) .<br />↵
Any help would be highly appreciated .
I was trying to solve this [problem](https://www.hackerearth.com/code-monk-triessuffix-tree/algorithm/power-of-string-3/) on Hackerearth the problem asks for the length of **the longest substring** which is repeated at least **K** times, **1 <= K <= |S| <= 10^6** <br /> <br />↵
I built the suffix array of the string and built the LCP array then get the maximum element among the minimum elements in all possible consecutive segments of length **K-1** in the LCP array, Thus, if the LCP array was **[0,1,2,3,2,3]** and K was **4** then we have : <br /><br />↵
1. [0,1,2] min is 0 <br />↵
2. [1,2,3] min is 1 <br />↵
3. [2,3,2] min is 2 <br />↵
4. [3,2,3] min is 2 <br /> <br />↵
Now the maximum element is 2 and this is the answer, My solution keeps getting WA on some test files, and unfortunately editorial page has no explanation about the solution, just two codes, one uses an absolutely different idea where it uses hashing and binary search (No idea!!) and the other one slightly uses the same idea using suffix tree instead but it's so messy and couldn't track it down. <br /> <br />↵
Here's my [code](http://pastebin.com/i4JHMr76) .<br />↵
Any help would be highly appreciated .
