Question

In data structures, you are required to complete the following tasks. Which of these tasks requires the application of a suffix tree data structure to
obtain an optimal time complexity:
Max. score 200
1. Pattern searching
2. Finding the longest-repeated substring
3. Finding the longest-common substring
4. Finding the longest-palindrome in a string
a . 1, 2, and 3
b. 2. 3 and 4
c. 1, 3, and 4
d . all​

Answer 1

Answer:

a option is correct answer