Q73
What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?
A.
Linear Time
AnswerB.
Exponential Time
C.
Logarithmic Time
D.
Cubic Time
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board