Data Structures :: Trie - Discussion
Home > Data Structures > Trie > MCQs Questions Discussion
22 / 30
Choose the correct option.
What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?
ALinear Time
BExponential Time
CLogarithmic Time
DCubic Time
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!