Vidyalelo
Data Structure · Q54

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 54

Q54

What is a time complexity for finding the longest prefix that is common between suffix in a string?

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

Answer: Option C

Solution

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