1.

What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

A. Linear Time
B. Exponential Time
C. Logarithmic Time
D. Cubic Time
Answer» B. Exponential Time


Discussion

No Comment Found