+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is a time complexity for finding all the maximal palindrome in a string?

(a) Ɵ (n)

(b) Ɵ (n!)

(c) Ɵ (1)

(d) O (log n!)

Question is from Suffix tree in chapter Trie of Data Structures & Algorithms I

I have been asked this question in examination.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (a) Ɵ (n)

The explanation is: Palindrome is a string that is the same when reading forward as well as backward. To check if a substring is present in a string of a length of n, the time complexity for such operation is found to be O (n). The time complexity for finding all the maximal palindrome in a string is Ɵ (n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...