suffix_tree
Construct a suffix tree from input text to count distinct substrings and identify the longest repeated substring for string analysis.
Instructions
Build a suffix tree (Ukkonen's algorithm) and compute distinct substrings and longest repeated substring.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| text | Yes | Input text (max 10,000 chars) |