Write a program that uses a suffix tree to find the longest repeated substring in a string s. After creating the tree, perform a tree traversal and find a node that has only leaf descendants and a longest substring determined by the path from the root to this node. Consider extending your program in one of three ways:
a. Find only nonoverlapping substrings.
b. Find the longest substring repeated at least k times.
c. Find all repeated substrings longer than m characters.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.