Q106
What is a time complexity for finding frequently occurring of a substring of minimum length in a string?
A.
Ɵ (n)
AnswerB.
Ɵ (n!)
C.
O (n2+ n1)
D.
O (log n!)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board