Vidyalelo
Data Structure · Q95

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 95

Q95

What is a time complexity for finding all the maximal palindrome in a string?

A.
Ɵ (n)
Answer
B.
Ɵ (n!)
C.
Ɵ (1)
D.
O (log n!)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board