Examveda

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: Option A


Join The Discussion

Related Questions on Advanced Trees (AVL, RedBlack, BTrees)